Minimum weight convolutional codewords of finite length (Corresp.)

DOI10.1109/TIT.1976.1055519zbMATH Open0318.94016OpenAlexW2044125580MaRDI QIDQ4081129FDOQ4081129

Authors: Gaylord K. Huth, Charles L. Weber 

Publication date: 1976

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

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

Recommendations

• Some convolutional codes whose free distances are maximal
• Tight bounds on the minimum average weight per branch for rate (N-1)/N convolutional codes
• On the structure of rate<tex>1/n</tex>convolutional codes
• scientific article; zbMATH DE number 3272068
• scientific article; zbMATH DE number 4104863

Mathematics Subject Classification ID

Bounds on codes (94B65) Convolutional codes (94B10)

Cited In (2)

• Cosets of convolutional codes with least possible maximum zero- and one-run lengths
• Title not available (Why is that?)

This page was built for publication: Minimum weight convolutional codewords of finite length (Corresp.)

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