The poset structures admitting the extended binary Hamming code to be a perfect code
SCIE
SCOPUS
- Title
- The poset structures admitting the extended binary Hamming code to be a perfect code
- Authors
- Hyun, JY; Kim, HK
- Date Issued
- 2004-11-28
- Publisher
- ELSEVIER SCIENCE BV
- Abstract
- Brualdi et al. introduced the concept of poset codes, and gave an example of poset structure which admits the extended binary Hamming code to be a double-error-coffecting perfect P-code. Our study is motivated by this example. In this paper we classify all poset structures which admit the extended binary Hamming code to be a double or triple-error-correcting perfect P-code. (C) 2004 Elsevier B.V. All rights reserved.
- Keywords
- poset codes; perfect P-code; strongly perfect P-code; extended Hamming code
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/24918
- DOI
- 10.1016/j.disc.2004.07.010
- ISSN
- 0012-365X
- Article Type
- Article
- Citation
- DISCRETE MATHEMATICS, vol. 288, no. 1-3, page. 37 - 47, 2004-11-28
- 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.