Abstract
The present paper is a sequel to the paper “On a class of error-correcting binary group codes”, by R. C. Base and D. K. Ray-Chaudhuri, appearing in Information and Control in which an explicit method of constructing a t -error correcting binary group code with n = 2 m − 1 places and k = 2 m − 1 − R(m,t) ≧ 2 m − 1 − mt information places is given. The present paper generalizes the methods of the earlier paper and gives a method of constructing a t -error correcting code with n places for any arbitrary n and k = n − R(m,t) ≧ [(2 m − 1)/c] − mt information places where m is the least integer such that cn = 2 m − 1 for some integer c . A second method of constructing t -error correcting codes for n places when n is not of the form 2 m − 1 is also 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.
