aqora

A Study on Secure Optical Orthogonal Codes

Tetsuo Tsujioka

IEICE Technical Report; IEICE Tech. Rep.Apr 16, 20071 citation

Optimal quaternary self-orthogonal code chains of short code length

Yiqun Li

The optimal quaternary self-orthogonal code reaching the bound of Griesmer is studied.By the methods of combination and the random search algorithm,the self-orthogonal code chains of short code length n(10≤n≤19) are constructed in the filed of GF(4).One result of the optimal self-orthogonal code chains with code length n(10≤n≤19) is given in this paper,and the parameters of codes in which meet the Griesmer bound.The results are important references to farther researching the construction of the self-orthogonal code chain and quantum code.The optimal quaternary self-orthogonal code reaching the bound of Griesmer is studied.By the methods of combination and the random search algorithm,the self-orthogonal code chains of short code length n(10≤n≤19) are constructed in the filed of GF(4).One result of the optimal self-orthogonal code chains with code length n(10≤n≤19) is given in this paper,and the parameters of codes in which meet the Griesmer bound.The results are important references to farther researching the construction of the self-orthogonal code chain and quantum code.

Computer Engineering and Applications JournalJan 1, 20070 citations

New Space/Wavelength/Time Optical Codes for OCDMA

T. L. Alderson

New constructions of 3-dimensional optical orthogonal codes are presented. In each case the codes have ideal autocorrelation a = 0, and cross correlation of c = 1. All codes produced are demonstrated to be optimal. The constructions utilize a particular automorphism (a Singer cycle) of PG(k; q), the finite projective geometry of dimension k over the field of order q, or its affine analogue in AG(k; q).

WSEAS TRANSACTIONS on COMMUNICATIONS archiveJan 1, 20171 citation

A new class of self-orthogonal linear codes and their applications

Yaozong Zhang, Dabin Zheng, Xiaoqiang Wang

arXiv:2311.18432Discrete MathematicsDec 8, 20251 citation

Three families of self-orthogonal codes and their application in optimal quantum codes

Dexiang Li, Ziling Heng, Chengju Li

Discrete MathematicsAug 3, 202312 citations

New results on self-orthogonal unequal error protection codes

Zhi Chen, Pingzhi Fan, Fan Jin

A lower bound on the length of binary self-orthogonal unequal error protection (UEP) codes is derived, and two design procedures for constructing optimal self-orthogonal UEP codes are proposed. With this lower bound, known self-orthogonal UEP codes can be evaluated. It is pointed out that, for given values of minimum distance and code rate, the self-orthogonal codes must be relatively long, so optimal self-orthogonal codes are not optimal in general. But self-orthogonal codes can be implemented simply, and they have error-correcting capabilities beyond those guaranteed by their minimum distance. These properties can be viewed as a partial compensation for using self-orthogonal codes.>A lower bound on the length of binary self-orthogonal unequal error protection (UEP) codes is derived, and two design procedures for constructing optimal self-orthogonal UEP codes are proposed. With this lower bound, known self-orthogonal UEP codes can be evaluated. It is pointed out that, for given values of minimum distance and code rate, the self-orthogonal codes must be relatively long, so optimal self-orthogonal codes are not optimal in general. But self-orthogonal codes can be implemented simply, and they have error-correcting capabilities beyond those guaranteed by their minimum distance. These properties can be viewed as a partial compensation for using self-orthogonal codes.>

IEEE Transactions on Information TheoryJan 1, 19909 citations

Bounds and constructions of optimal optical orthogonal codes with low correlation zone

Related papers

Bounds and constructions of optimal optical orthogonal codes with low correlation zone

Related papers