Abstract
We investigate nonsystematic perfect binary codes of length n, establishing that nonsystematic perfect codes of length n exist for all admissible $n \geq 15$. This improves on the result of Avgustinovich and Solov'eva [ Proc. 5th Internat. Workshop Algebraic and Combinatorial Coding Theory, Cosopol, Bulgaria, 1996, pp. 15--19] who have established the existence of such codes for $n\geq 255$. We also provide the results of a computer investigation of nonsystematic perfect codes of length 15.
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.
