Abstract
Problems of computing the generator polynomial for a (q+1, q-d+2) reversible cyclic BCH code over GF(q), q=p/sup m/, having the minimum Hamming distance d, are presented. The considered code is almost as short as a Reed-Solomon (RS) code but it generates codewords with two information symbols more than the codewords of RS code with the same minimum Hamming distance. >
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.
