Error probability bounds for systematic convolutional codes
Authors:
- E. BucherEBE. Bucher
- J. HellerJHJ. Heller
- 1 March 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 16 (2) , 219-224
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- Sequential decoding for efficient communication from deep spaceIEEE Transactions on Communication Technology, 1967
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithmIEEE Transactions on Information Theory, 1967
- Lower bounds to error probability for coding on discrete memoryless channels. IInformation and Control, 1967
- Inverse problems in coding, automata, and continuous systems1967
- A simple derivation of the coding theorem and some applicationsIEEE Transactions on Information Theory, 1965
- Some properties of binary convolutional code generatorsIEEE Transactions on Information Theory, 1965