Some infinite classes of optimal \({(v,\{3,4\},1,Q)}\)-OOCs with \({Q\in\{(\frac{1}{3},\frac{2}{3}),(\frac{2}{3},\frac{1}{3})\}}\)
From MaRDI portal
Publication:2637728
DOI10.1007/s00373-012-1235-2zbMath1408.05032OpenAlexW2020546350MaRDI QIDQ2637728
Publication date: 14 February 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1235-2
Applications of design theory to circuits and networks (94C30) Combinatorial aspects of packing and covering (05B40)
Related Items
New optimal \((v, \{3,5\}, 1, Q)\) optical orthogonal codes, Constructions of optimal balanced \( (m, n, \{4, 5\}, 1) \)-OOSPCs, Constructions for optimal \((u\times v,\{3,4\},1,Q)\)-OOSPCs, Balanced \(( \mathbb{Z}_{2u}\times \mathbb{Z}_{38v}, \{3, 4, 5\}, 1)\) difference packings and related codes, On balanced \(( \mathbb{Z}_{4 u} \times \mathbb{Z}_{8 v}, \{4, 5 \}, 1)\) difference packings, Combinatorial constructions for optimal multiple-weight optical orthogonal signature pattern codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New optimal optical orthogonal codes by restrictions to subgroups
- 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
- Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
- Strong difference families, difference covers, and their applications for relative difference families
- On difference matrices and regular latin squares
- Starters and related codes
- Some combinatorial constructions for optical orthogonal codes
- Cyclic designs with block size 4 and related optimal optical orthogonal codes
- Pairwise balanced designs from finite fields
- Some progress on \((v,4,1)\) difference families and optical orthogonal codes
- Constructions for optimal optical orthogonal codes
- Some difference matrix constructions and an almost completion for the existence of triplewhist tournaments TWh(\(v\)).
- On (\(g\), 4; 1)-difference matrices
- Optical orthogonal codes: their bounds and new optimal constructions
- Optimal (9v, 4, 1) Optical Orthogonal Codes
- Variable-weight optical orthogonal codes for CDMA networks with multiple performance requirements
- Constructions of optimal variable-weight optical orthogonal codes
- Perfect difference families, perfect difference matrices, and related combinatorial structures
- Recursive constructions for optimal (n,4,2)-OOCs
- Optimal (4up, 5, 1) optical orthogonal codes
- Optical orthogonal codes-new bounds and an optimal construction
- Constant Weight Conflict-Avoiding Codes
- A new recursive construction for optical orthogonal codes
- A New Class of Optimal Optical Orthogonal Codes With Weight Five
- Strong difference families over arbitrary graphs
- The collision channel without feedback
- Optical orthogonal codes: design, analysis and applications
- Constructions for optimal (υ, 4, 1) optical orthogonal codes
- Constructions of optimal optical orthogonal codes with weight five
- Combinatorial constructions of optimal optical orthogonal codes with weight 4
- Constructions for optimal constant weight cyclically permutable codes and difference families
- Optical orthogonal codes with unequal auto- and cross-correlation constraints
- Bounds and Constructions of Optimal ($n, 4, 2, 1$) Optical Orthogonal Codes
- Relative Difference Families With Variable Block Sizes and Their Related OOCs
- General Constructions of Optimal Variable-Weight Optical Orthogonal Codes
- Optimal Variable-Weight Optical Orthogonal Codes via Difference Packings
- Constructions for point-regular linear spaces
