Answers are grounded in this paper and cite their sources.
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
No takes yet. Share an insight, caveat, or question.
Georgiou et al. (2007) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: