Optimal (v, 4, 2, 1) optical orthogonal codes with small parameters
From MaRDI portal
Publication:3165564
DOI10.1002/jcd.20296zbMath1264.94116OpenAlexW2962860433MaRDI QIDQ3165564
Svetlana Topalova, Tsonka Stefanova Baicheva
Publication date: 29 October 2012
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20296
Other designs, configurations (05B30) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial codes (94B25)
Related Items
Optimal \((v,5,2,1)\) optical orthogonal codes of small \(v\) ⋮ Unnamed Item ⋮ Further results on optimal \((n, \{3, 4, 5\}, \Lambda_a, 1, Q)\)-OOCs ⋮ On optimal \((v,5,2,1)\) optical orthogonal codes ⋮ Further results on balanced \((n, \{3, 4 \}, \Lambda_a, 1)\)-OOCs ⋮ Further results on optimal \((v,4,2,1)\)-OOCs ⋮ Bounds and constructions for optimal \((n, \{3, 5 \}, \varLambda_a, 1, Q)\)-OOCs ⋮ Classification of optimal conflict-avoiding codes of weights 6 and 7 ⋮ Optimal conflict-avoiding codes for three, four and five active users
Cites Work
- Unnamed Item
- New results on optimal \((v,4,2,1)\) optical orthogonal codes
- New optimal optical orthogonal codes by restrictions to subgroups
- Classification of optimal \((v, 4, 1)\) binary cyclically permutable constant-weight codes and cyclic \(2\)-\((v, 4, 1)\) designs with \(v \leq 76\).
- Classification algorithms for codes and designs
- Further results on \((v,4,1)\)-perfect difference families
- Optimal \((n,4,2)\)-OOC of small orders.
- Isomorphism problem for relational structures with a cyclic automorphism
- Optical orthogonal codes: their bounds and new optimal constructions
- Optical orthogonal codes: design, analysis and applications
- On Cyclic Steiner 2-Designs
- A solution of the isomorphism problem for circulant graphs
- Optical orthogonal codes with unequal auto- and cross-correlation constraints
- Bounds and Constructions of Optimal ($n, 4, 2, 1$) Optical Orthogonal Codes
