---
title: "Bibliography"
canonical: "https://docs.magma-maths.org/CodingTheory/LinearCodes/bibliography.html"
source: "https://docs.magma-maths.org/CodingTheory/LinearCodes/bibliography.md"
part: "Coding Theory"
chapter: "Linear Codes over Finite Fields"
breadcrumbs:
  - {"title": "Magma Handbook", "source": "../../index.md"}
  - {"title": "Coding Theory", "source": "../index-coding-theory.md"}
  - {"title": "Linear Codes over Finite Fields", "source": "index-linear-codes.md"}
prev: {"title": "Automorphism Groups", "source": "group-action.md"}
next: {"title": "Algebraic-Geometric Codes", "source": "../AlgebraicGeometricCodes/index-algebraic-geometric-codes.md"}
---

# Bibliography

<a id="cite-alltopxx"></a>
- **[All84]** W.O. Alltop. A method for extending binary linear codes. *IEEE Trans. Inform. Theory*, 30:871 – 872, 1984.
<a id="cite-bv2015a"></a>
- **[BV16b]** R. Barrolleta and M. Villanueva. Partial permutation decoding for binary linear and $\Z_4$-linear Hadamard codes. Submitted to Designs, Codes and Cryptography, arXiv:1512.01839, 2016.
<a id="cite-zimm1"></a>
- **[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. ISBN 3-540-64502-0.
<a id="cite-brouwerweb"></a>
- **[Bro]** A. E. Brouwer. Bounds on the minimum distance of linear codes. http://www.win.tue.nl/ aeb/voorlincod.html.
<a id="cite-brouwer"></a>
- **[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.
<a id="cite-key"></a>
- **[FKM12]** W. Fish, J. Key, and E. Mwambene. Partial permutation decoding for simplex codes. *Advances in Mathematics of Communications*, 6(4):505–516, 2012.
<a id="cite-gaborit02"></a>
- **[Gab02]** Philippe Gaborit. Quadratic Double Circulant Codes over Fields. *Journal of Combinatorial Theory*, 97:85–107, 2002.
<a id="cite-grasslweblin"></a>
- **[Graa]** Markus Grassl. Bounds on the minimum distance of linear codes. http://www.codetables.de/.
<a id="cite-leon1"></a>
- **[Leo82]** Jeffrey S. Leon. Computing automorphism groups of error-correcting codes. *IEEE Trans. Inform. Theory*, IT-28:496–511, 1982.
<a id="cite-leon2"></a>
- **[Leo97]** Jeffrey S. Leon. Partitions, refinements, and permutation group computation. In Larry Finkelstein and William M. Kantor, editors, *Groups and Computation II*, volume 28 of Dimacs series in Discrete Mathematics and Computer Science, 123–158. Providence R.I., 1997. Amer. Math. Soc.
<a id="cite-sloane"></a>
- **[MS78]** F.J. MacWilliams and N.J.A. Sloane. *The Theory of Error-Correcting Codes*. North Holland, New York, 1978. ISBN 0-444-850090.