| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 430966 | Journal of Discrete Algorithms | 2012 | 9 Pages |
Abstract
Let dq(n,k)dq(n,k) be the maximum possible minimum Hamming distance of a linear [n,kn,k] code over FqFq. Tables of best known linear codes exist for small fields. In this paper, linear codes over F13F13 are constructed for k up to 6. The codes constructed are from the class of quasi-cyclic codes. The number of m×mm×m circulant matrices over FqFq is enumerated. In addition, the minimum distance of the extended quadratic residue code of length 44 is determined.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Vadlamudi Ch. Venkaiah, T. Aaron Gulliver,