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-correcting perfect binary codes with a crown poset structure.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
