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

DOI10.1109/18.651075zbMath1053.94568OpenAlexW2125102719MaRDI QIDQ4392481

Øyvind Ytrehus, Kjell Jørgen Hole

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)

Related Items (1)

On maximum length convolutional codes under a trellis complexity constraint

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