The poset structures admitting the extended binary Hamming code to be a perfect code
From MaRDI portal
Publication:704279
DOI10.1016/j.disc.2004.07.010zbMath1077.94022OpenAlexW2067929867MaRDI QIDQ704279
Jong Yoon Hyun, Hyun Kwang Kim
Publication date: 13 January 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.010
Related Items (12)
Perfect codes in poset spaces and poset block spaces ⋮ Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces ⋮ Classification of weighted posets and digraphs admitting the extended Hamming code to be a perfect code ⋮ On perfect poset codes ⋮ Perfect codes in poset block spaces ⋮ The poset structures admitting the extended binary Golay code to be a perfect code ⋮ Groups of linear isometries on poset structures ⋮ Weighted Hamming metric structures ⋮ The packing radius of a code and partitioning problems: the case for poset metrics on finite vector spaces ⋮ Maximum distance separable poset codes ⋮ Symmetry groups of Rosenbloom-Tsfasman spaces ⋮ On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure
Cites Work
This page was built for publication: The poset structures admitting the extended binary Hamming code to be a perfect code