Cosets of convolutional codes with short maximum zero-run lengths

DOI10.1109/18.391258MaRDI QIDQ4857518zbMATH OpenOpenAlexFDO

Authors Kjell Jørgen Hole

Publication date 4 February 1996

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

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

zbMATH Keywords

convolutional codeshort maximum zero-run lengthsymbol synchronization

Mathematics Subject Classification ID

Convolutional codes (94B10) Synchronization error-correcting codes (94B50)

Recommendations

• Cosets of convolutional codes with least possible maximum zero- and one-run lengths
• Improved coding techniques for preceded partial-response channels
• Convolutional codes I: Algebraic structure
• Binary convolutional codes with application to magnetic recording
• Further results on the synchronization of binary cyclic codes (Corresp.)

Cited in

(1)

• Cosets of convolutional codes with least possible maximum zero- and one-run lengths

This page was built for publication: Cosets of convolutional codes with short maximum zero-run lengths

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