Encoding and decoding for the minimization of message symbol error rates in linear block codes
IEEE Transactions on Information Theory
Convolutional Codes: An Algebraic Approach
Convolutional Codes: An Algebraic Approach
Combined Speech and Channel Coding for Wireless Communications
Wireless Personal Communications: An International Journal
Minimal and canonical rational generator matrices for convolutional codes
IEEE Transactions on Information Theory - Part 1
Unequal error protection for convolutional codes
IEEE Transactions on Information Theory
Joint network/channel decoding for heterogeneous multi-source/multi-relay cooperative networks
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Hi-index | 754.84 |
In this paper, convolutional codes are studied for unequal error protection (UEP) from an algebraic theoretical viewpoint. We first show that for every convolutional code there exists at least one optimal generator matrix with respect to UEP. The UEP optimality of convolutional encoders is then combined with several algebraic properties, e.g., systematic, basic, canonical, and minimal, to establish the fundamentals of convolutional codes for UEP. In addition, a generic lower bound on the length of a UEP convolutional code is proposed. Good UEP codes with their lengths equal to the derived lower bound are obtained by computer search.