Abstract
Error-correcting codes with both binary and ternary coordinates are considered. The maximum cardinality of such a code with n 2 binary coordinates, n 3 ternary coordinates, and minimum distance d is denoted by N(n 2,n 3,d) . A computer-aided method based on backtrack search and isomorph rejection is here used to settle many values of N(n 2,n 3,3) ; several new upper bounds on this function are also obtained. For small parameters, a complete classification of optimal codes is carried out. It is shown that the maximum cardinality of a ternary one-error-correcting code of length 6 is 38 and that this code is unique.
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.
