Pseudocodeword performance analysis for LDPC convolutional codes
IEEE Transactions on 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
Short quasi-cyclic LDPC codes from convolutional codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Error performance analysis of signal superposition coded cooperative diversity
IEEE Transactions on Communications
A rate R = 5/20 hypergraph-based woven convolutional code with free distance 120
IEEE Transactions on Information Theory
Woven graph codes: asymptotic performances and examples
IEEE Transactions on Information Theory
Woven convolutional graph codes with large free distances
Problems of Information Transmission
| Hi-index | 755.02 |
When searching for convolutional codes and tailbiting codes of high complexity it is of vital importance to use fast algorithms for computing their weight spectra, which corresponds to finding low-weight paths in their code trellises. This can be efficiently done by a combined search in both forward and backward code trees. A bidirectional efficient algorithm for searching such code trees (BEAST) is presented. For large encoder memories, it is shown that BEAST is significantly more efficient than comparable algorithms. BEAST made it possible to find new convolutional and tailbiting codes that have larger free (minimum) distances than the previously best known codes with the same parameters. Tables of such codes are presented.