Maximum w‐cyclic holey group divisible packings with block size three and applications to optical orthogonal codes
From MaRDI portal
Publication:6146196
DOI10.1002/jcd.21797arXiv2006.06921OpenAlexW3187726686MaRDI QIDQ6146196
No author found.
Publication date: 5 February 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.06921
Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)
Cites Work
- \(w\)-cyclic holey group divisible designs and their application to three-dimensional optical orthogonal codes
- Recursive constructions for cyclic block designs
- A new class of group divisible designs with block size three
- Balanced incomplete block designs and related designs
- A general construction for optimal cyclic packing designs
- On 2-chromatic \((v,5,1)\)-designs
- Semi-cyclic holey group divisible designs with block size three
- Some difference matrix constructions and an almost completion for the existence of triplewhist tournaments TWh(\(v\)).
- On (\(g\), 4; 1)-difference matrices
- Semi-cyclic Holey Group Divisible Designs and Applications to Sampling Designs and Optical Orthogonal Codes
- Combinatorial Constructions of Optimal Three-Dimensional Optical Orthogonal Codes
- The collision channel without feedback
- Optical orthogonal codes: design, analysis and applications
- Two-Dimensional Optical Orthogonal Codes and Semicyclic Group Divisible Designs
- Determination of Sizes of Optimal Three‐Dimensional Optical Orthogonal Codes of Weight Three with the AM‐OPP Restriction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Maximum w‐cyclic holey group divisible packings with block size three and applications to optical orthogonal codes