Convergence analysis of generalized serial message-passing schedules
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
A novel channel coding scheme of accumulate repeat tree codes
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Capacity-achieving codes with bounded graphical complexity and maximum likelihood decoding
IEEE Transactions on Information Theory
Simple capacity-achieving ensembles of rateless erasure-correcting codes
IEEE Transactions on Communications
| Hi-index | 754.90 |
This paper is concerned with a family of concatenated tree (CT) codes. CT codes are special low-density parity check (LDPC) codes consisting of several trees with large spans. They can also be regarded as special turbo codes with hybrid recursive/nonrecursive parts and multiple constituent codes. CT codes are decodable by the belief-propagation algorithm. They combine many advantages of LDPC and turbo codes, such as low decoding cost, fast convergence speed, and good performance