The preparata codes and a class of 4‐designs

DOI10.1002/JCD.3180020307zbMATH Open0817.05011OpenAlexW1993191758MaRDI QIDQ4764655FDOQ4764655

Authors: Alphonse Baartmans, Iliya Blushkov, Vladimir D. Tonchev 

Publication date: 11 July 1995

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.3180020307

Recommendations

• A class of Steiner 4-wise balanced designs derived from preparata codes
• An infinite family of 3-designs from Preparata codes over \(\mathbb{Z}_4\)
• Weight distribution of preparata codes over \(Z_4\) and the construction of 3-designs
• New infinite families of 3-designs from Preparata codes over \(\mathbb{Z}_4\)
• On the weight hierarchy of Preparata codes over Z/sub 4/
• Designs in additive codes over GF(4)
• An Infinite Family of Linear Codes Supporting 4-Designs
• On \(t\)-designs from codes over \(\mathbb{Z}_4\)

zbMATH Keywords

\(t\)-designsextension theoremPreparata code

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25) Steiner systems in finite geometry (51E10)

Cited In (7)

• A coding theoretic approach to extending designs
• Generalized Preparata codes and 2-resolvable Steiner quadruple systems
• Weight distribution of preparata codes over \(Z_4\) and the construction of 3-designs
• Point-missing \(s\)-resolvable \(t\)-designs: infinite series of 4-designs with constant index
• On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight codes
• On the minimum distance graph of an extended Preparata code
• Constructing optimal four-level designs via Gray map code

This page was built for publication: The preparata codes and a class of 4‐designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764655)