The Poset Metrics That Allow Binary Codes of Codimension $m$ to be $m$-, $(m-1)$-, or $(m-2)$-Perfect

DOI10.1109/TIT.2008.929972zbMath1319.94100arXiv0705.2807OpenAlexW2950887441MaRDI QIDQ3604944

Hyun Kwang Kim, Denis S. Krotov

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0705.2807

zbMATH Keywords

perfect codesposet codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (2)

On perfect poset codes ⋮ MDS and \(I\)-perfect poset block codes

This page was built for publication: The Poset Metrics That Allow Binary Codes of Codimension $m$ to be $m$-, $(m-1)$-, or $(m-2)$-Perfect