On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure
SCIE
SCOPUS
- Title
- On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure
- Authors
- Kim, HK; Oh, DY
- Date Issued
- 2005-07-28
- Publisher
- ELSEVIER SCIENCE BV
- Abstract
- Ahn et al. [Discrete Math. 268 (2003) 21-30] characterized completely the parameters of single-and error-correcting perfect linear codes with a crown poset structure by solving Ramanujan-Nagell-type Diophantine equation. In this paper, we give a shorter proof for the same result by analyzing a generator matrix of a perfect linear code. Furthermore, we combine our method with the Johnson bound in coding theory to prove that there are no triple-error-coffecting perfect binary codes with a crown poset structure. (c) 2005 Elsevier B.V. All rights reserved.
- Keywords
- crown poset; Johnson bound; perfect Poset code
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/24419
- DOI
- 10.1016/j.disc.2005.03.018
- ISSN
- 0012-365X
- Article Type
- Article
- Citation
- DISCRETE MATHEMATICS, vol. 297, no. 1-3, page. 174 - 181, 2005-07-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.