A new decoding algorithm for some convolutional codes constructed from block codes is given. The algorithm utilizes the decoding algorithm for the corresponding block code. It is shown that the codes obtained from one-step orthogonalizable block codes are majority decodable.Error propagation in some of these convolutional codes is studied. It is shown that if decoded with moderately reduced capability, these codes exhibit limited error propagation. A mode switching decoding method is suggested to realize a larger error correction capability while maintaining limited error propagation
This thesis is concerned with the area of decoding techniques of concatenated, error correcting code...
A brief introduction to convolutional coding is given. The active distances are reviewed and shown t...
This thesis is concerned with the area of decoding techniques of concatenated, error correcting code...
A new decoding algorithm for some convolutional codes constructed from block codes is given. The alg...
The development and investigation of decoding algorithms for block and convolution codes are the aim...
Some new techniques to derive convolutional codes from block codes are given. The techniques given r...
The evaluation of the union bound for theber of Reed-Solomon/Convolutional concatenated codes indica...
The evaluation of the union bound for theber of Reed-Solomon/Convolutional concatenated codes indica...
The evaluation of the union bound for theber of Reed-Solomon/Convolutional concatenated codes indica...
A new approach to soft decision decoding of block codes and concatenated block-convolutional codes i...
The work of this group is focused on the dual problems of ascertaining the best per-formance that ca...
It is shown how the decoding algorithms of Pellikaan and Rosenthal can be coupled to produce a decod...
Summary form only given, as follows. Error control strategies for finite-state channels often utiliz...
Convolutional codes are characterized by a trellis structure. Maximum-likelihood decoding is charact...
Practical decoding algorithms for channels with unknown (or varying) statistics are highly desired i...
This thesis is concerned with the area of decoding techniques of concatenated, error correcting code...
A brief introduction to convolutional coding is given. The active distances are reviewed and shown t...
This thesis is concerned with the area of decoding techniques of concatenated, error correcting code...
A new decoding algorithm for some convolutional codes constructed from block codes is given. The alg...
The development and investigation of decoding algorithms for block and convolution codes are the aim...
Some new techniques to derive convolutional codes from block codes are given. The techniques given r...
The evaluation of the union bound for theber of Reed-Solomon/Convolutional concatenated codes indica...
The evaluation of the union bound for theber of Reed-Solomon/Convolutional concatenated codes indica...
The evaluation of the union bound for theber of Reed-Solomon/Convolutional concatenated codes indica...
A new approach to soft decision decoding of block codes and concatenated block-convolutional codes i...
The work of this group is focused on the dual problems of ascertaining the best per-formance that ca...
It is shown how the decoding algorithms of Pellikaan and Rosenthal can be coupled to produce a decod...
Summary form only given, as follows. Error control strategies for finite-state channels often utiliz...
Convolutional codes are characterized by a trellis structure. Maximum-likelihood decoding is charact...
Practical decoding algorithms for channels with unknown (or varying) statistics are highly desired i...
This thesis is concerned with the area of decoding techniques of concatenated, error correcting code...
A brief introduction to convolutional coding is given. The active distances are reviewed and shown t...
This thesis is concerned with the area of decoding techniques of concatenated, error correcting code...