3-Dimensional Optical Orthogonal Codes With Ideal Autocorrelation-Bounds and Optimal Constructions

DOI10.1109/TIT.2017.2717538MaRDI QIDQ5375583zbMATH OpenFDO

Authors Tim L. Alderson

Publication date 14 September 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1702.06455

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Abstract: Several new constructions of 3-dimensional optical orthogonal codes are presented here. In each case the codes have ideal autocorrelation $mathbflambd{a}_a=0$, and in all but one case a cross correlation of $mathbflambd{a}_c=1$. All codes produced are optimal with respect to the applicable Johnson bound either presented or developed here. Thus, on one hand the codes are as large as possible, and on the other, the bound(s) are shown to be tight. All codes are constructed by using a particular automorphism (a Singer cycle) of $mathbfPG(k,q)$, the finite projective geometry of dimension $k$ over the field of order $mathbfq$, or by using an affine analogue in $AG(k,q)$.

Cited in

(3)

• New asymptotically optimal three-dimensional wave-length/space/time optical orthogonal codes for OCDMA systems
• n-dimensional optical orthogonal codes, bounds and optimal constructions
• \(w\)-cyclic holey group divisible designs and their application to three-dimensional optical orthogonal codes

This page was built for publication: 3-Dimensional Optical Orthogonal Codes With Ideal Autocorrelation-Bounds and Optimal Constructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375583)