Wireless communications systems and networks
Transmission and reception with multiple antennas: theoretical foundations
Communications and Information Theory
Searching for high-rate convolutional codes via binary syndrome trellises
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
New constructions of low-complexity convolutional codes
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Multiobjective optimization for pre-DFT combining in coded SIMO-OFDM systems
IEEE Communications Letters
New constructions of high-performance low-complexity convolutional codes
IEEE Transactions on Communications
Hi-index | 754.84 |
We provide useful results on two classes of convolutional codes: binary codes and nonbinary codes. The best codes or the best known codes for these two classes of convolutional codes are found, by computer search. Some of them are better than those found in the past. We specify these codes by their transfer function matrices, distance spectra, and information-weight spectra. Furthermore, we derive an upper bound on the free distances of binary-to-M-ary codes and q-ary-to-M-ary codes. Numerical values of this bound closely fit the computer-searched values