Abstract
A (105, 10, 47) binary quasi-cyclic code is presented which improves the known lower bound on the maximum possible minimum distance. The generator matrix is characterized in terms of m × m circulant matrices, where m = 5. This code is extended with an even parity check bit to a (106, 10, 48) code which also improves the known bound. The weight distributions of these codes are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.