Normalized second moment of the binary lattice determined by a convolutional code
Publication
, Journal Article
Calderbank, AR; Fishburn, PC
Published in: Proceedings of the 1993 IEEE International Symposium on Information Theory
January 1, 1993
The output of a finite state machine is a collection of codewords that can be searched efficiently to find the optimum codeword with respect to any nonnegative measure that can be calculated on a symbol by symbol basis. Applications involving trellis codes are considered. Although details are given for the convolutional code, the method can be applied to arbitrary codes.
Duke Scholars
Published In
Proceedings of the 1993 IEEE International Symposium on Information Theory
Publication Date
January 1, 1993
Start / End Page
137
Citation
APA
Chicago
ICMJE
MLA
NLM
Calderbank, A. R., & Fishburn, P. C. (1993). Normalized second moment of the binary lattice determined by a convolutional code. Proceedings of the 1993 IEEE International Symposium on Information Theory, 137.
Calderbank, A. R., and P. C. Fishburn. “Normalized second moment of the binary lattice determined by a convolutional code.” Proceedings of the 1993 IEEE International Symposium on Information Theory, January 1, 1993, 137.
Calderbank AR, Fishburn PC. Normalized second moment of the binary lattice determined by a convolutional code. Proceedings of the 1993 IEEE International Symposium on Information Theory. 1993 Jan 1;137.
Calderbank, A. R., and P. C. Fishburn. “Normalized second moment of the binary lattice determined by a convolutional code.” Proceedings of the 1993 IEEE International Symposium on Information Theory, Jan. 1993, p. 137.
Calderbank AR, Fishburn PC. Normalized second moment of the binary lattice determined by a convolutional code. Proceedings of the 1993 IEEE International Symposium on Information Theory. 1993 Jan 1;137.
Published In
Proceedings of the 1993 IEEE International Symposium on Information Theory
Publication Date
January 1, 1993
Start / End Page
137