Decoding of block codes obtained from convolution codes
From MaRDI portal
The paper presents a decoding algorithm for block codes which are obtained from convolutional codes by tail biting [cf. \textit{H. H. Ma} and \textit{J. K. Wolf}, IEEE Trans. Commun. COM-34, No.2, 104-111 (1986; Zbl 0586.94020)]. It is shown that for the presented decoding method there are block codes achieving the same asymptotic decoding error versus decoding complexity ratio as convolutional codes with Viterbi decoding.
Recommendations
Cited in
(10)- Convolutional-block coding in channels with decision feedback
- Decoding concatenated codes with inner convolutional codes
- On low complexity stack decoding of convolutional codes
- scientific article; zbMATH DE number 3880586 (Why is no real title available?)
- Novel block convolutional code
- BEAST Decoding of Block Codes Obtained Via Convolutional Codes
- Binary unequal error-protection block codes formed from convolutional codes by generalized tail-biting
- Iterative decoding of binary block and convolutional codes
- scientific article; zbMATH DE number 910962 (Why is no real title available?)
- How to find small AI-systems for antiblocking decoding
This page was built for publication: Decoding of block codes obtained from convolution codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751626)
