Bibliography

All84

W.O. Alltop.
A method for extending binary linear codes.
IEEE Trans. Inform. Theory, 30:871 -- 872, 1984.

BFK+98

A. Betten, H. Fripertinger, A. Kerber, A. Wassermann, and K.-H. Zimmer-mann.
Codierungstheorie -- Konstruktion und Anwendung linearer Codes.
Springer-Verlag, Berlin--Heidelberg--New York, 1998.

Bro

A. E. Brouwer.
Bounds on the minimum distance of linear codes.
http://www.win.tue.nl/~aeb/voorlincod.html.

Bro98

A. E. Brouwer.
Bounds on the size of linear codes.
In Handbook of coding theory, Vol. I, II, pages 295--461. North-Holland, Amsterdam, 1998.

BV16

R. Barrolleta and M. Villanueva.
Partial permutation decoding for binary linear and Z₄-linear Hadamard codes.
Submitted to Designs, Codes and Cryptography, arXiv:1512.01839, 2016.

FKM12

W. Fish, J. Key, and E. Mwambene.
Partial permutation decoding for simplex codes.
Advances in Mathematics of Communications, 6(4):505--516, 2012.

Gab02

Philippe Gaborit.
Quadratic Double Circulant Codes over Fields.
Journal of Combinatorial Theory, 97:85--107, 2002.

Gra

Markus Grassl.
Bounds on the minimum distance of linear codes.
http://www.codetables.de/.

Leo82

Jeffrey S. Leon.
Computing automorphism groups of error-correcting codes.
IEEE Trans. Inform. Theory, IT-28:496--511, 1982.

Leo97

Jeffrey S. Leon.
Partitions, refinements, and permutation group com-pu-ta-tion.
In Larry Finkelstein and William M. Kantor, editors, Groups and Computation II, volume 28 of Dimacs series in Discrete Mathematics and Computer Science, pages 123--158, Providence R.I., 1997. Amer. Math. Soc.

MS78

F.J. MacWilliams and N.J.A. Sloane.
The Theory of Error-Correcting Codes.
North Holland, New York, 1978.