Robustly optimal rate one-half binary convolutional codes (Corresp.)

DOI10.1109/TIT.1975.1055397zbMATH Open0304.94017MaRDI QIDQ4060862FDOQ4060862

Authors: Rolf Johannesson 

Publication date: 1975

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

Recommendations

• Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile (Corresp.)
• New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile
• Short convolutional codes with maximal free distance for rates 1/2, 1/3, and 1/4 (Corresp.)
• Some convolutional codes whose free distances are maximal
• Minimum distance estimates of the performance of sequential decoders

zbMATH Keywords

minimum distancecomputer simulationfree distancedistance profileoptimality criteria for convolutional codes

Mathematics Subject Classification ID

Convolutional codes (94B10) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Cited In (3)

• Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile (Corresp.)
• Realization of 2D convolutional codes of rate \(\frac{1}{n}\) by separable Roesser models
• Convolutional codes with optimum bidirectional distance profile

This page was built for publication: Robustly optimal rate one-half binary convolutional codes (Corresp.)

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