The Poset Metrics That Allow Binary Codes of Codimension m to be m-, (m-1)-, or (m-2)-Perfect
From MaRDI portal
Publication:3604944
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 disjoin chains. Index terms: perfect codes, poset codes
Recommendations
- Poset codes: partial orders, metrics and coding theory
- Codes with a poset metric
- Projective systems and perfect codes with a poset metric.
- On perfect poset codes
- Perfect codes in poset spaces and poset block spaces
- The poset structures admitting the extended binary Hamming code to be a perfect code
- The poset structures admitting the extended binary Golay code to be a perfect code
- Error-block codes and poset metrics
- Codes with a pomset metric and constructions
- The packing radius of a code and partitioning problems: the case for poset metrics on finite vector spaces
Cited in
(4)
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604944)
