New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile

DOI10.1109/18.771238MaRDI QIDQ4701428zbMATH OpenOpenAlexFDO

Authors P. Ståhl, Rolf Johannesson

Publication date 21 November 1999

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.771238

zbMATH Keywords

tablesfree distanceoptimum distance profilepolynomial convolutional encoders

Mathematics Subject Classification ID

Convolutional codes (94B10)

Recommendations

• Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile (Corresp.)
• Short convolutional codes with maximal free distance for rates 1/2, 1/3, and 1/4 (Corresp.)
• Robustly optimal rate one-half binary convolutional codes (Corresp.)
• scientific article; zbMATH DE number 820513
• Enumeration of minimal convolutional encoders (Corresp.)

Cited in

(5)

• Robustly optimal rate one-half binary convolutional codes (Corresp.)
• A fast algorithm for computing distance spectrum of convolutional codes
• On locally invertible rate-1/n convolutional encoders
• Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile (Corresp.)
• Convolutional codes with optimum bidirectional distance profile

This page was built for publication: New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701428)