Error probability bounds for systematic convolutional codes
Edward A. Bucher, J. A. Heller · IEEE Transactions on Information Theory · 1970
Upper and lower bounds on error probability for systematic convolutional codes are obtained. These bounds show that the probability of error for a systematic convolutional code is larger than the probability of error for a nonsystematic convolutional code of the same encoder-shift-register length. Two different interpretations of these results are given.
Cited by 18 works. doi:10.1109/tit.1970.1054440
Authors
References
- Information Theory and Reliable Communication
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- A simple derivation of the coding theorem and some applications
- Lower bounds to error probability for coding on discrete memoryless channels. I
- Lower bounds to error probability for coding on discrete memoryless channels. II
- Some properties of binary convolutional code generators
- Sequential decoding for efficient communication from deep space
- Inverse problems in coding, automata, and continuous systems