On unit constraint-length convolutional codes

DOI10.1109/18.108274MaRDI QIDQ3991415zbMATH OpenOpenAlexFDO

Authors Khaled Abdel-Ghaffar

Publication date 28 June 1992

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

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

zbMATH Keywords

dual codelinear block codesMacWilliams identityminimum distancesUnit constraint length convolutional codesweight enumerator

Mathematics Subject Classification ID

Convolutional codes (94B10)

Recommendations

• Some convolutional codes whose free distances are maximal
• scientific article; zbMATH DE number 1714666
• Quasi-cyclic unit memory convolutional codes
• On the weight distribution of convolutional codes
• An algebraic construction of rate<tex>1/v</tex>-ary codes; algebraic construction (Corresp.)

Cited in

(4)

• On the weight distribution of convolutional codes
• scientific article; zbMATH DE number 1714666 (Why is no real title available?)
• Dual convolutional codes and the MacWilliams identities
• Using combinatorial optimization to design good unit-memory convolutional codes

This page was built for publication: On unit constraint-length convolutional codes

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