Maximal ( v, k, 2, 1) Optical Orthogonal Codes with k = 6 and 7 and Small Lengths

Tsonka Baicheva () and Svetlana Topalova
Additional contact information
Tsonka Baicheva: Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 1113 Sofia, Bulgaria
Svetlana Topalova: Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 1113 Sofia, Bulgaria

Mathematics, 2023, vol. 11, issue 11, 1-14

Abstract: Optical orthogonal codes (OOCs) are used in optical code division multiple access systems to allow a large number of users to communicate simultaneously with a low error probability. The number of simultaneous users is at most as big as the number of codewords of such a code. We consider ( v , k , 2 , 1 ) -OOCs, namely OOCs with length v , weight k , auto-correlation 2, and cross-correlation 1. An upper bound B 0 ( v , k , 2 , 1 ) on the maximal number of codewords of such an OOC was derived in 1995. The number of codes that meet this bound, however, is very small. For k ≤ 5 , the ( v , k , 2 , 1 ) -OOCs have already been thoroughly studied by many authors, and new upper bounds were derived for ( v , 4 , 2 , 1 ) in 2011, and for ( v , 5 , 2 , 1 ) in 2012. In the present paper, we determine constructively the maximal size of ( v , 6 , 2 , 1 ) - and ( v , 7 , 2 , 1 ) -OOCs for v ≤ 165 and v ≤ 153 , respectively. Using the types of the possible codewords, we calculate an upper bound B 1 ( v , k , 2 , 1 ) ≤ B 0 ( v , k , 2 , 1 ) on the code size of ( v , 6 , 2 , 1 ) - and ( v , 7 , 2 , 1 ) -OOCs for each length v ≤ 720 and v ≤ 340 , respectively.

Keywords: optical orthogonal code; construction; optimal; code division multiple access system (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/11/2457/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/11/2457/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:11:p:2457-:d:1156326

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().