๐Ÿ“–
On optimal (v,5,3,1) optical orthogonal codes
Laura Johnson, Lorenzo Mella, Anita Pasotti, Emma Smith

On optimal (v,5,3,1) optical orthogonal codes

Science & Mathematics Published 2026 Verification Pending

Overview & Synopsis

In this paper, we establish a tight upper bound for the size of a $(v,5,3,1)$ optical orthogonal code (OOC) and call such a code optimal when it achieves this upper bound. In addition, if an optimal OOC has the property that all non-identity elements of $\mathbb{Z}_v$ are covered by the list of differences of its codeword-sets then it is called perfect. In this paper, we present direct and recursive constructions for infinite classes of optimal and perfect $(v,5,3,1)$-OOCs.

Indexed from repository: arXiv (arxiv.org)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title On optimal (v,5,3,1) optical orthogonal codes
Author / Organization Laura Johnson, Lorenzo Mella, Anita Pasotti, Emma Smith
Subject & Discipline math.CO
Categories Science & Mathematics
Publication Year 2026
License / Rights arXiv Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website arXiv (arxiv.org)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-266235
Original Source Link Visit Source Page on arxiv.org »