Optical orthogonal codes obtained from conics on finite projective planes

Authors:
Nobuko Miyamoto;Hirobumi Mizuno;Satoshi Shinohara
Affiliations:
Department of Information Sciences, Tokyo University of Science, Noda, Chiba 278-8510, Japan;Faculty of Informatics, Meisei University, Oume, Tokyo 198-8655, Japan;Faculty of Informatics, Meisei University, Oume, Tokyo 198-8655, Japan
Venue:
Finite Fields and Their Applications
Year:
2004

Citing 3
Cited 8

The last packing number of quadruples, and cyclic SQS

Designs, Codes and Cryptography
Optical orthogonal codes: design, analysis and applications

IEEE Transactions on Information Theory
Optical orthogonal codes-new bounds and an optimal construction

IEEE Transactions on Information Theory

On constructions for optimal two-dimensional optical orthogonal codes

Designs, Codes and Cryptography
Signature code designing for OCDMA system based on Steiner system on affine plane

AsiaCSN '08 Proceedings of the Fifth IASTED International Conference on Communication Systems and Networks
Sequences for phase-encoded optical CDMA

SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
Optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4

IEEE Transactions on Information Theory
Spectral classification and multiplicative partitioning of constant-weight sequences based on circulant matrix representation of optical orthogonal codes

IEEE Transactions on Information Theory
Codes for optical CDMA

SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Optical orthogonal codes and arcs in PG (d,q)

Finite Fields and Their Applications
New optimal optical orthogonal codes by restrictions to subgroups

Finite Fields and Their Applications

Quantified Score

Hi-index	0.12

Visualization

Abstract

Optical orthogonal codes can be applied to fiber optical code division multiple access (CDMA) communications. In this paper, we show that optical orthogonal codes with auto- and cross-correlations at most 2 can be obtained from conics on a finite projective plane. In addition, the obtained codes asymptotically attain the upper bound on the number of codewords when the order q of the base field is large enough.