Abstract
A new class of binary group error-correcting codes is formalized and defined. The codes are generated by irreducible and primitive polynomials over the binary field by an iterative procedure. A general formula for the number of corregible errors related to the lengthn of the code vectors is given. A method to obtain from a given code a class of subcodes is described. The encoding and decoding (error-detecting, error-correcting) procedures are extremely simple and use linear shift registers. A general formula describing the number of operations involved is given.
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.
