On classes of rate k/(k+1) convolutional codes and their decoding techniques

DOI10.1109/18.556606MaRDI QIDQ4336400zbMATH OpenOpenAlexFDO

Authors Pisit Charnkeitkong, Kazuhiko Yamaguchi, Hideki Imai

Publication date 12 May 1997

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

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

zbMATH Keywords

convolutional codesmaximum-likelihood decodingdecoding complexities

Mathematics Subject Classification ID

Convolutional codes (94B10) Decoding (94B35)

Recommendations

• On the structure of rate<tex>1/n</tex>convolutional codes
• On a class of convolutional codes
• scientific article; zbMATH DE number 4055532
• An algebraic construction of rate<tex>1/v</tex>-ary codes; algebraic construction (Corresp.)
• Syndrome decoding of binary-rate<tex>k/n</tex>convolutional codes
• On classes of convolutional codes that are not asymptotically catastrophic
• scientific article; zbMATH DE number 3865152
• On the enumeration and generation of nonweight equivalent rate \(\frac12\) convolutional codes
• A class of convolution codes
• Classification of convolutional codes

Cited in

(4)

• On maximum length convolutional codes under a trellis complexity constraint
• An algebraic construction of rate<tex>1/v</tex>-ary codes; algebraic construction (Corresp.)
• Realization of 2D convolutional codes of rate \(\frac{1}{n}\) by separable Roesser models
• Extension of coefficients for (\(n, k, m\)) convolutional-code-based packet loss recovery

This page was built for publication: On classes of rate k/(k+1) convolutional codes and their decoding techniques

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