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

DOI10.1109/18.651075MaRDI QIDQ4392481zbMATH OpenOpenAlexFDO

Authors Kjell Jørgen Hole, Øyvind Ytrehus

Publication date 1998

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

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

Mathematics Subject Classification ID

Convolutional codes (94B10)

Recommendations

• Cosets of convolutional codes with short maximum zero-run lengths
• Some new runlength-limited convolutional codes
• On maximum length convolutional codes under a trellis complexity constraint
• Some convolutional codes whose free distances are maximal
• On a class of convolutional codes
• On the cosets of the simplex code
• Minimum weight convolutional codewords of finite length (Corresp.)
• scientific article; zbMATH DE number 1456813
• On cyclotomic cosets and code constructions
• Minimal Trellis Modules and Equivalent Convolutional Codes

Cited in

(2)

• On maximum length convolutional codes under a trellis complexity constraint
• Cosets of convolutional codes with short maximum zero-run lengths

This page was built for publication: Cosets of convolutional codes with least possible maximum zero- and one-run lengths

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