Optimum mean-square error use of convolutional codes

DOI10.1109/TIT.1985.1057005MaRDI QIDQ3220485zbMATH OpenOpenAlexFDO

Authors G. Robert Redinbo

Publication date 1985

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

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

zbMATH Keywords

mean-square errorlinear convolutional code

Mathematics Subject Classification ID

Convolutional codes (94B10) Decoding (94B35)

Recommendations

• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• Convolutional codes I: Algebraic structure
• scientific article; zbMATH DE number 721804
• Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile (Corresp.)
• Two classes of convolutional codes over GF(q) for q-ary orthogonal signaling

Cited in

(7)

• Convolutional codes I: Algebraic structure
• scientific article; zbMATH DE number 721804 (Why is no real title available?)
• CONVOLUTIONAL CODES FOR PHASE-MODULATED CHANNELS
• Recursive GF\((2^N)\) encoders using left-circulate function for optimum PSK-TCM schemes
• The Correlation of the Output of a Binary Convolutional Encoder
• Design of convolution encoder using quantum dot cellular automata
• Generalized threshold decoding of convolutional codes

This page was built for publication: Optimum mean-square error use of convolutional codes

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