Bounded distance coset decoding of convolutional codes
Abstract
The paper presents a maximumlikelihood consistent bounded distance decoding algorithm for convolutional codes. The algorithm correctly decodes all error sequences which fall within the errorcorrecting sphere. A class of codes is defined, in which the decoder exploits the fact that only certain error sequences need to be corrected. For these codes the decoding is based on a reduced encoder state diagram. Thus, only a subset of the trellis or tree has to be searched in order to find the error pattern. An exact characterization of the reduced state diagram is given in the paper along with an example.
 Publication:

IEE Proceedings F: Communications Radar and Signal Processing
 Pub Date:
 August 1986
 Bibcode:
 1986IPCRS.133..488J
 Keywords:

 Communication Theory;
 Convolution Integrals;
 Decoding;
 Error Correcting Codes;
 Maximum Likelihood Estimates;
 Algorithms;
 Information Theory;
 Set Theory;
 Trees (Mathematics);
 Communications and Radar