Abstract
Let dq (n,k) be the maximum possible minimum Hamming distance of a linear [n,k] code over double-struck Fq. Tables of best known linear codes exist for all fields up to q = 9. In this paper, linear codes over double-struck F13 are constructed for k up to 6. The codes constructed are from the class of quasi-cyclic codes. In addition, the minimum distance of the extended quadratic residue code of length 44 is determined. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Gulliver, T. A. (2011). Quasi-cyclic codes over double-struck F13. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7056 LNCS, pp. 236–246). https://doi.org/10.1007/978-3-642-25011-8_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
