On viewing block codes as finite automata☆
Under an Elsevier user license
open archive
Keywords
Block codes
Tail-biting trellis
Decoder complexity
Maximum likelihood decoding
Cited by (0)
- ☆
The material in this paper was presented in part at STACS 2000, Lille, France.
Copyright © 2002 Elsevier Science B.V. All rights reserved.