Quasi-Cyclic Codes by Bierbrauer and Gulliver

In [1] a non-exhaustive heuristic combinatorial search is used for finding quasi-cyclic codes of dimension n ∈ {3, 4, 5} over F9. The generating polynomials of the following codes can be found in [1, Table 1] and in the two examples on the following page:

snd
36331
48342
55348
24419
32426
40433
45437
55446
105490
1194102
1264108
1304111
32524
40531
48538
55544
66553
77563
80565
88572
99582
110591
1215101
1325110

References

[1]Jürgen Bierbrauer and T. Aaron Gulliver.
New linear codes over F9.
The Australasian Journal of Combinatorics, 21:131–140, 2000.
MR1758264 (2000m:94032)

Copyright

Copyright © 2004, 2005, 2006, 2007, 2008, 2009, 2010 by Rudolf Schürer and Wolfgang Ch. Schmid.
Cite this as: Rudolf Schürer and Wolfgang Ch. Schmid. “Quasi-Cyclic Codes by Bierbrauer and Gulliver.” From MinT—the database of optimal net, code, OA, and OOA parameters. Version: 2008-04-04. http://mint.sbg.ac.at/desc_CBierbrauerGulliverQuasiCyclic.html

Show usage of this method