|
47
|
On the Trellis Structure of Block Codes
– Frank R. Kschischang, Vladislav Sorokine
- 1995
|
|
34
|
Minimal tail-biting trellises: The Golay code and more
– A R Calderbank, G D Forney, A Vardy
- 1999
|
|
56
|
Minimal trellises for block codes
– D J Muder
- 1988
|
|
15
|
Proof of a Conjecture of McEliece Regarding the Expansion Index of the Minimal Trellis
– A Vardy, F R Kschischang
- 1996
|
|
27
|
Trellis structure of codes, Handbook of Coding Theory
– A Vardy
- 1998
|
|
866
|
Optimal decoding of linear codes for minimizing symbol error rate
– L R Bahl, J Cocke, F Jelinek, J Raviv
- 1974
|
|
9
|
On the Theory of Linear Trellises
– Ralf Koetter, Alexander Vardy
- 2002
|
|
15
|
The Structure of Tail-Biting Trellises: Minimality and Basic Principles
– Ralf Koetter, Alexander Vardy
- 2002
|
|
25
|
Foundation and methods of channel encoding
– J L Massey
- 1978
|
|
74
|
Efficient maximum likelihood decoding of linear block codes
– J K Wolf
- 1978
|
|
25
|
Coset codes II: Binary lattices and related codes
– G D Forney
- 1988
|
|
20
|
Lower bounds on trellis complexity of block codes
– A Lafourcade, A Vardy
- 1995
|
|
81
|
The Z_4-linearity of Kerdock, Preparata, Goethals, and related codes
– A. Roger Hammons, Jr., P. Vijay Kumar, A. R. Calderbank, N. J. A. Sloane, Patrick SolĂ©
- 2001
|
|
37
|
On the BCJR trellis for linear block codes
– Robert J. Mceliece
- 1996
|
|
5
|
Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes
– I Reuven, Y Be'ery
- 1998
|
|
599
|
The Viterbi algorithm
– J D Forney
- 1973
|
|
1606
|
The Theory of Error Correcting Codes
– F J MacWilliams, N J A Sloane
- 1986
|
|
30
|
On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
– T Kasami, T Takata, T Fujiwara, S Lin
- 1993
|
|
9
|
Construction of minimal tail-biting trellises
– R Koetter, A Vardy
- 1998
|