Abstract
There are four diversities for which ternary linear codes of dimension k ? 3, minimum distance d with gcd(3,d) = 1 are always extendable. Moreover, three of them yield double extendability when d ? 1 (mod 3). All the diversities are found for ternary linear codes of dimension 3 ? k ? 6. An algorithm how to find an extension from a generator matrix 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.
