Abstract
This correspondence presents a complete solution to the problem of constructing maximal q -nary codes, for any word length n and minimum distance d in the region qd \geq (q - 1)n . Several interesting results regarding the interdependence of these codes are developed, which reveal the unique structure of the code spaces of the region qd \geq (q - 1)n . Some new maximal codes are obtained for the region qd .
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.
