The poset metrics that allow binary codes of codimension m to be m-, (m-1)-, or (m-2)-perfect Full article
| Journal |
IEEE Transactions on Information Theory
ISSN: 0018-9448 , E-ISSN: 1557-9654 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2008, Volume: 54, Number: 11, Pages: 5241-5246 Pages count : 6 DOI: 10.1109/tit.2008.929972 | ||||
| Tags | perfect codes, poset codes | ||||
| Authors |
|
||||
| Affiliations |
|
Abstract:
A binary poset code of codimension m (of cardinality 2^{n-m}, where n is the code length) can correct maximum m errors. All possible poset metrics; that allow codes of codimension m to be m-, (m-1)-, or (m-2)-perfect are described. Some general conditions on a poset which guarantee the nonexistence of perfect poset codes are derived; as examples, we prove the nonexistence of r-perfect poset codes for some r in the case of the crown poset and in the case of the union of disjoint chains.
Cite:
Kim H.K.
, Krotov D.S.
The poset metrics that allow binary codes of codimension m to be m-, (m-1)-, or (m-2)-perfect
IEEE Transactions on Information Theory. 2008. V.54. N11. P.5241-5246. DOI: 10.1109/tit.2008.929972 WOS Scopus РИНЦ OpenAlex
The poset metrics that allow binary codes of codimension m to be m-, (m-1)-, or (m-2)-perfect
IEEE Transactions on Information Theory. 2008. V.54. N11. P.5241-5246. DOI: 10.1109/tit.2008.929972 WOS Scopus РИНЦ OpenAlex
Dates:
| Submitted: | Dec 20, 2007 |
| Accepted: | Aug 6, 2008 |
| Published online: | Oct 22, 2008 |
Identifiers:
| Web of science: | WOS:000260426400035 |
| Scopus: | 2-s2.0-55349104773 |
| Elibrary: | 13591718 |
| OpenAlex: | W2950887441 |