Abstract
In this paper some good quasi-cyclic codes over GF(3) are presented. These quasi-cyclic codes improve the already known lower bounds on the minimum distance of the previously known quasi-cyclic codes. Even though these codes do not improve the minimum distance of the best unstructured code known, their beautiful structure and simplicity provide several advantages in comparison to other random codes. Also, three of the ternary quasi-cyclic codes presented have parameters [66,11,33;3], [65,13,30;3], [56,14,24;3] and so their minimum distances beat the minimum distances of the previously known quasi-cyclic codes and meet the minimum distances of the best unstructured linear codes with these parameters. Mathematics Subject Classification: 94B05, 94B25
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.
