A general construction for optimal cyclic packing designs

DOI10.1006/JCTA.2001.3215zbMath0991.05028OpenAlexW2090856277MaRDI QIDQ1604562

Jianxing Yin

Publication date: 4 July 2002

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.2001.3215

zbMATH Keywords

packing designoptical orthogonal codecyclic design

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Related Items (16)

On constructions for optimal two-dimensional optical orthogonal codes ⋮ Resolvable generalized difference matrices: existence and applications ⋮ Balanced \(( \mathbb{Z}_{2u}\times \mathbb{Z}_{38v}, \{3, 4, 5\}, 1)\) difference packings and related codes ⋮ Semicyclic 4-GDDs and related two-dimensional optical orthogonal codes ⋮ Maximum w‐cyclic holey group divisible packings with block size three and applications to optical orthogonal codes ⋮ Short k‐radius sequences, k‐difference sequences and universal cycles ⋮ Constructions of difference covering arrays. ⋮ Further results on optimal optical orthogonal codes with weight 4. ⋮ Constructions of cyclic quaternary constant-weight codes of weight three and distance four ⋮ Constructions of almost difference families ⋮ Semi-cyclic holey group divisible designs with block size three ⋮ Some 20-regular CDP(5,1;20\(u\)) and their applications ⋮ Constructions of optical orthogonal codes based on cyclic \(t\)-wise quasi-difference matrices ⋮ Maximum \(w\)-cyclic holey group divisible packings and their application to three-dimensional optical orthogonal codes ⋮ Cyclic difference packing and covering arrays. ⋮ Compatible difference packing set systems and their applications to multilength variable-weight OOCs

Cites Work

• On a composition of cyclic 2-designs
• Balanced incomplete block designs and related designs
• Some recent developments on BIBDs and related designs
• Starters and related codes
• Some combinatorial constructions for optical orthogonal codes
• Optical orthogonal codes: their bounds and new optimal constructions
• Optical orthogonal codes: design, analysis and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A general construction for optimal cyclic packing designs