Bibliography

1

L.R. Bahl, J. Cocke, F. Jelinek, and J. Raviv.
Optimal decoding of linear codes for minimizing symbol error rate.
IEEE Transactions on Information Theory, 20:284-287, 1974.

2

A.E. Brouwer and T. Verhoeff.
An updated table of minimum-distance bounds for binary linear codes.
IEEE Transactions on Information Theory, 39:662-677, 1993.

3

R.A. Brualdi and V.S. Pless.
Greedy codes.
Journal of Comb. Th. (A), 64:10-30, September 1993.

4

J.H. Conway.
Integral lexicographic codes.
Discrete Math, 83:219 - 235, 1990.

5

J.H. Conway and N.J.A. Sloane.
Lexicographic codes: error-correcting codes from game theory.
IEEE Transactions on Information Theory, 32:337-348, 1986.

6

R.L. Graham and N.J.A. Sloane.
On the covering radius of codes.
IEEE Trans. Inf. Theory, 31:385-401, 1985.

7

F.R. Kschischang and G.B. Horn.
A heuristic for ordering a linear block code to minimize trellis state complexity.
In Proc. 32-nd Annual Allerton Conference on Communications, Control and Computing, pages 75-84, Monticello, IL, September 1994.

8

F.R. Kschischang and V. Sorokine.
On the trellis structure of block codes.
IEEE Transactions on Information Theory, 41:1924-1937, 1995.

9

V.I. Levenstein.
A class of systematic codes.
Soviet Math. Dokl., 1(1):368-371, 1960.

10

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

11

R.J. McEliece.
On the BCJR trellis for linear block codes.
IEEE Transactions on Information Theory, 42:1072-1092, 1996.

12

D.J. Muder.
Minimal trellises for block codes.
IEEE Transactions on Information Theory, 34:1049-1053, 1988.

13

Ari Trachtenberg.
Graph-based decoding of error-correcting codes.
PhD thesis, University of Illinois at Urbana/Champaign, January 2000.

14

A. Vardy.
Trellis structure of codes.
In V.S. Pless and W. Cary Huffman, editors, Handbook of Coding Theory. Elsevier Science Publishers, Amsterdam, 1998.

15

S. Zhang.
Design of linear block codes with fixed state complexity.
Master's thesis, University of Toronto, 1996.

We show data gleaned from the implementation of many of the algorithms in this paper. More complete simulation results are available in [13].