L.
Bazzi
S. K.
Mitter

# Some constructions of codes from group actions

preprint
March 2003 (submitted)
E.
Gabidulin
A.
Davydov
L.
Tombak

# Linear codes with covering radius 2 and other new covering codes

IEEE Trans. Inform. Theory
1991
37
1
219–224
S.
Gao

# A new algorithm for decoding Reed-Solomon codes

Communications, Information and Network Security (V. Bhargava, H. V. Poor, V. Tarokh and S. Yoon, Eds.)
2003
55–68
Kluwer Academic Publishers
J.
von zur Gathen
J.
Gerhard

# Modern computer algebra

Cambridge Univ. Press
2003
R.
Graham
N.
Sloane

# On the covering radius of codes

IEEE Trans. Inform. Theory
1985
31
1
385–401
J. P.
Hansen

# Toric surfaces and error-correcting codes

Coding theory, cryptography, and related areas (ed., Bachmann et al)
1999
Springer-Verlag
H. J.
Helgert

# Srivastava codes

IEEE Trans. Inform. Theory
1972
18
292–297
March
W. C.
Huffman
V.
Pless

# Fundamentals of error-correcting codes

Cambridge Univ. Press
2003
D.
Joyner

# Toric codes over finite fields

Applicable Algebra in Engineering, Communication and Computing
2004
15
63–79
J.
Justesen
T.
Hoholdt

# A course in error-correcting codes

European Mathematical Society
2004
J. S.
Leon

# Computing automorphism groups of error-correcting codes

IEEE Trans. Inform. Theory
1982
28
496–511
May
J. S.
Leon

# A probabilistic algorithm for computing minimum weights of large error-correcting codes

IEEE Trans. Inform. Theory
1988
34
1354–1359
September
J. S.
Leon

# Permutation group algorithms based on partitions, I: theory and algorithms

J. Symbolic Comput.
1991
12
533–583
F. J.
MacWilliams
N. J. A.
Sloane

# The theory of error-correcting codes

Amsterdam: North-Holland
1983
H.
Stichtenoth

# Algebraic function fields and codes

Springer-Verlag
1993
A. E.
Brouwer

# Bounds on the minimum distance of linear codes

\href{http://www.win.tue.nl/~aeb/voorlincod.html}{http://www.win.tue.nl/~aeb/voorlincod.html}
1997-2006
M.
Harada
W.
Holzmann
H.
Kharaghani
M.
Khorvash

# Extremal Ternary Self-Dual Codes Constructed from Negacirculant Matrices

Graphs and Combinatorics
2007
23
4
401–417
N.
Sloane
S.
Reddy
C.
Chen

# New binary codes

IEEE Trans. Inform. Theory
1972
18
503–510
Jul
W. O.
Alltop

# A method for extending binary linear codes

IEEE Trans. Inform. Theory
1984
30
871–872
A. E.
Brouwer

# Bounds on the Size of Linear Codes

Handbook of Coding Theory
{Elsevier, North Holland}
1998
V. S.
Pless
W. C.
Huffman
295–461
C. L.
Chen

# Some Results on Algebraically Structured Error-Correcting Codes

{University of Hawaii}
1969
Ph.{D} Dissertation

    USA

K. H.
Zimmermann

# Integral Hecke Modules, Integral Generalized Reed-Muller Codes, and Linear Codes

Technische Universität Hamburg-Harburg
1996
3–96

    Hamburg, Germany

R.
Gallager

# Low-Density Parity-Check Codes

IRE Trans. Inform. Theory
1962
IT-8
21–28
Jan
R.
Tanner
D.
Sridhara
A.
Sridharan
T.
Fuja
D.
Costello Jr.

# LDPC Block and Convolutional Codes Based on Circulant Matrices

IEEE Trans. Inform. Theory
2004
50
12
2966–2984
Dec