New results on optimal \((v,4,2,1)\) optical orthogonal codes
From MaRDI portal
Publication:629878
DOI10.1007/s10623-010-9382-zzbMath1230.05079OpenAlexW1993653705MaRDI QIDQ629878
Anita Pasotti, Koji Momihara, Marco Buratti
Publication date: 10 March 2011
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-010-9382-z
Related Items (15)
Optimal (v, 4, 2, 1) optical orthogonal codes with small parameters ⋮ Bounds and Constructions on (v, 4, 3, 2) Optical Orthogonal Codes ⋮ Optimal \((v,5,2,1)\) optical orthogonal codes of small \(v\) ⋮ The sizes of maximal \((v,k,k-2,k-1)\) optical orthogonal codes ⋮ Further results on optimal \((n, \{3, 4, 5\}, \Lambda_a, 1, Q)\)-OOCs ⋮ Combinatorial constructions for maximum optical orthogonal signature pattern codes ⋮ Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes ⋮ Some progress on optimal 2-D \((n\times m,3,2,1) \)-optical orthogonal codes ⋮ On optimal \((v,5,2,1)\) optical orthogonal codes ⋮ The sizes of optimal \((n,4,\lambda,3)\) optical orthogonal codes ⋮ Further results on balanced \((n, \{3, 4 \}, \Lambda_a, 1)\)-OOCs ⋮ Further results on optimal \((v,4,2,1)\)-OOCs ⋮ Classification of optimal \((v,k,1)\) binary cyclically permutable constant weight codes with \(k=5, 6\) and \(7\) and small lengths ⋮ Bounds and constructions for optimal \((n, \{3, 5 \}, \varLambda_a, 1, Q)\)-OOCs ⋮ Classification of optimal \((v, 4, 1)\) binary cyclically permutable constant-weight codes and cyclic \(2\)-\((v, 4, 1)\) designs with \(v \leq 76\).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
- On cyclic \(2(k-1)\)-support \((n,k)_{k-1}\) difference families
- Constructions for strictly cyclic 3-designs and applications to optimal OOCs with \(\lambda =2\)
- Further progress on difference families with block size 4 or 5
- Geometric constructions of optimal optical orthogonal codes
- Strong difference families, difference covers, and their applications for relative difference families
- Combinatorial designs and the theorem of Weil on multiplicative character sums
- Sharply transitive decompositions of complete graphs into generalized Petersen graphs
- Existence of \((q,6,1)\) difference families with \(q\) a prime power
- Cyclic designs with block size 4 and related optimal optical orthogonal codes
- Some progress on \((v,4,1)\) difference families and optical orthogonal codes
- Cyclotomy and difference families in elementary Abelian groups
- Recursive constructions for optimal (n,4,2)-OOCs
- Families of Optimal OOCs With $\lambda = 2$
- Optical orthogonal codes: design, analysis and applications
- Existence of (q,k, 1) difference families withq a prime power andk = 4, 5
- Constructions of optimal optical orthogonal codes with weight five
- Optical orthogonal codes with unequal auto- and cross-correlation constraints
- Bounds and Constructions of Optimal ($n, 4, 2, 1$) Optical Orthogonal Codes
- ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
This page was built for publication: New results on optimal \((v,4,2,1)\) optical orthogonal codes
