Fundamentals of Convolutional Coding
Fundamentals of Convolutional Coding
Encoder and Distance Properties of Woven Convolutional Codes with One Tailbiting Component Code
Problems of Information Transmission
A Distance Measure Tailored to Tailbiting Codes
Problems of Information Transmission
Active distances for convolutional codes
IEEE Transactions on Information Theory
Woven convolutional codes .I. Encoder properties
IEEE Transactions on Information Theory
Tailbiting codes obtained via convolutional codes with large active distance-slopes
IEEE Transactions on Information Theory
Maximum slope convolutional codes
IEEE Transactions on Information Theory
Woven convolutional codes. II: decoding aspects
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In convolutional coding, code sequences have infinite length; thus, a maximum-likelihood decoder implies an infinite delay. Due to memory and delay constraints in practical coding schemes, convolutional codes often are either terminated or decoded by a window decoder. When a window decoder is used, the convolutional code sequence is not terminated; instead, the window decoder estimates information digits after receiving a finite number of noise-corrupted code symbols, thereby keeping the decoding delay short. An exact characterization of the error-correcting capability of window decoded convolutional codes is given by using active distances of convolutional codes.