The Poset Metrics That Allow Binary Codes of Codimension m to be m-, (m-1)-, or (m-2)-Perfect
SCIE
SCOPUS
- Title
- The Poset Metrics That Allow Binary Codes of Codimension m to be m-, (m-1)-, or (m-2)-Perfect
- Authors
- Kim, HK; Krotov, DS
- Date Issued
- 2008-11
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGI
- 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.
- Keywords
- Perfect codes; poset codes; LINEAR CODES
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/22432
- DOI
- 10.1109/TIT.2008.929972
- ISSN
- 0018-9448
- Article Type
- Article
- Citation
- IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 54, no. 11, page. 5241 - 5246, 2008-11
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.