The poset metrics that allow binary codes of codimension m to be m-, (m-1)-, or (m-2)-perfect
| dc.creator | Kim, Hyun Kwang | |
| dc.creator | Krotov, Denis | |
| dc.date | 2007-05-19 | |
| dc.date | 2008-10-26 | |
| dc.date.accessioned | 2026-07-07T10:12:47Z | |
| dc.date.available | 2026-07-07T10:12:47Z | |
| dc.description | 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 disjoin chains. Index terms: perfect codes, poset codes | |
| dc.description | 6pp, 33fig. V2: revised | |
| dc.identifier | https://arxiv.org/abs/0705.2807 | |
| dc.identifier | http://arxiv.org/abs/0705.2807 | |
| dc.identifier | IEEE Trans. Inf. Theory 54(11) 2008, 5241-5246 | |
| dc.identifier | doi:10.1109/TIT.2008.929972 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/172303 | |
| dc.subject | Combinatorics | |
| dc.subject | Discrete Mathematics | |
| dc.subject | 94B60 | |
| dc.title | The poset metrics that allow binary codes of codimension m to be m-, (m-1)-, or (m-2)-perfect | |
| dc.type | text |