The poset structures admitting the extended binary Golay code to be a perfect code
From MaRDI portal
Publication:941330
DOI10.1016/j.disc.2007.07.111zbMath1145.94026OpenAlexW4213005959MaRDI QIDQ941330
Dong Yeol Oh, Changrim Jang, Hyun Kwang Kim, Yoomi Rho
Publication date: 4 September 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.111
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items
Perfect codes in poset spaces and poset block spaces, Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces, On perfect poset codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The poset structures admitting the extended binary Hamming code to be a perfect code
- Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
- Codes for the \(m\)-metric
- Classification of perfect linear codes with crown poset structure
- Codes with a poset metric