Referenced Items are not available for this document.
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.
Published in:
Information Theory, IEEE Transactions on
(Volume:56
,
Issue:
1
)
Date of Publication: Jan. 2010
- Page(s):
- 316 - 331
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 11024754
- Digital Object Identifier :
- 10.1109/TIT.2009.2034784
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 28 December 2009
- Issue Date :
- Jan. 2010
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
