A new class of recurrent codes

DOI10.1109/TIT.1969.1054357MaRDI QIDQ5568908zbMATH OpenFDO

Authors Harry T. Hsu

Publication date 1969

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

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

zbMATH Keywords

information, communication

Recommendations

• Recurrent Codes: Easily Mechanized, Burst-Correcting, Binary Codes
• Repeated low-density burst error detecting codes
• On type-B1 burst-error-correcting convolutional codes
• A class of binary burst error-correcting quasi-cyclic codes
• scientific article; zbMATH DE number 5912447

Cited in

(6)

• A class of binary burst error-correcting quasi-cyclic codes
• scientific article; zbMATH DE number 3552378 (Why is no real title available?)
• Recurrent Codes: Easily Mechanized, Burst-Correcting, Binary Codes
• A comparison of block and recurrent codes for the correction of independent errors (Corresp.)
• On type-B1 burst-error-correcting convolutional codes
• A note on burst-error correcting recurrent codes†

This page was built for publication: A new class of recurrent codes

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