Optimal \((v,5,2,1)\) optical orthogonal codes of small \(v\)
From MaRDI portal
Publication:371238
DOI10.1007/s00200-013-0192-1zbMath1272.05013MaRDI QIDQ371238
Svetlana Topalova, Tsonka Stefanova Baicheva
Publication date: 30 September 2013
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-013-0192-1
classification; combinatorial design; cyclic group; optical orthogonal code; binary constant weight code
05B05: Combinatorial aspects of block designs
05B30: Other designs, configurations
51E10: Steiner systems in finite geometry
05B10: Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.)
94B60: Other types of codes
94B25: Combinatorial codes
Related Items
Further results on balanced \((n, \{3, 4 \}, \Lambda_a, 1)\)-OOCs, Optimal conflict-avoiding codes for three, four and five active users
Cites Work
- Unnamed Item
- Unnamed Item
- New results on optimal \((v,4,2,1)\) optical orthogonal codes
- Further results on optimal \((v,4,2,1)\)-OOCs
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
- 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
- On cyclic \(2(k-1)\)-support \((n,k)_{k-1}\) difference families
- On the Bays-Lambossy theorem
- Further results on \((v,4,1)\)-perfect difference families
- Further progress on difference families with block size 4 or 5
- Optimal \((n,4,2)\)-OOC of small orders.
- On optimal \((v,5,2,1)\) optical orthogonal codes
- Optical orthogonal codes: their bounds and new optimal constructions
- Randomized parallel algorithms for backtrack search and branch-and-bound computation
- Optimal (v, 4, 2, 1) optical orthogonal codes with small parameters
- Optical orthogonal codes: design, analysis and applications
- Optical orthogonal codes with unequal auto- and cross-correlation constraints
- Bounds and Constructions of Optimal ($n, 4, 2, 1$) Optical Orthogonal Codes