Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 56, Issue 1, Pages 316-331Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2009.2034784
Keywords
Braided convolutional codes; codes on graphs; convolutional permutor; free distance; iterative decoding; turbo-like codes
Funding
- National Science Foundation (NSF) [CCR02-05310]
- U.S. Army [DAAD16-02-C-0057]
- NASA [NNG05GH73G]
Ask authors/readers for more resources
We present a new class of iteratively decodable turbo-like codes, called braided convolutional codes. Constructions and encoding procedures for tightly and sparsely braided convolutional codes are introduced. Sparsely braided codes exhibit good convergence behavior with iterative decoding, and a statistical analysis using Markov permutors shows that the free distance of these codes grows linearly with constraint length, i.e., they are asymptotically good.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available