On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure

DOI10.1016/j.disc.2005.03.018zbMath1119.94015OpenAlexW2062088447MaRDI QIDQ2566155

Dong Yeol Oh, Hyun Kwang Kim

Publication date: 22 September 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.03.018

zbMATH Keywords

Johnson boundcrown posetperfect poset code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (2)

Perfect codes in poset spaces and poset block spaces ⋮ On perfect poset codes

Cites Work

• Unnamed Item
• Point sets and sequences with small discrepancy
• The poset structures admitting the extended binary Hamming code to be a perfect code
• A combinatorial problem for vector spaces over finite fields
• Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
• Classification of perfect linear codes with crown poset structure
• On a MacWilliams type identity and a perfectness for a binary linear (\(n,n-1,j\))-poset code.
• Codes with a poset metric

This page was built for publication: On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure