New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile
Authors:
- R. JohannessonRJR. Johannesson
- P. StahlPSP. Stahl
- 1 July 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (5) , 1653-1658
Abstract
Tabulations of binary systematic and nonsystematic polynomial convolutional encoders with an optimum distance profile for rate 1/2, 1/3, and 1/4 are given. The reported encoders are found by computer searches that optimize over the weight spectra. The free distances for rate 1/3 and 1/4 are compared with Heller's (1968) and Griesmer's (1960) upper boundKeywords
This publication has 7 references indexed in Scilit:
- Fundamentals of Convolutional Coding1999
- A fast algorithm for computing distance spectrum of convolutional codesIEEE Transactions on Information Theory, 1989
- Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile (Corresp.)IEEE Transactions on Information Theory, 1977
- Distance and computation in sequential decodingIEEE Transactions on Communications, 1976
- Robustly optimal rate one-half binary convolutional codes (Corresp.)IEEE Transactions on Information Theory, 1975
- A construction technique for random-error-correcting convolutional codesIEEE Transactions on Information Theory, 1969
- A Bound for Error-Correcting CodesIBM Journal of Research and Development, 1960