Abstract
The representation of the Nordstrom-Robinson optimum quadratic (15, 8) code in terms of polynomials over GF(2) (i.e.,, linear cyclic codes) leads to a nonheuristic proof of the distance properties of this code. In this paper it is shown that the weight and distance structures can be treated analogously and that the minimum distance and weight are 5. The analysis of this mechanism may be an essential step in the discovery of an entire class of nonlinear double error correcting codes.
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.
