Loading...

A novel iterative decoding method for DFT codes in erasure channels

Azmi, P ; Sharif University of Technology | 2004

206 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-540-27824-5_74
  3. Publisher: Springer Verlag , 2004
  4. Abstract:
  5. One of the categories of decoding techniques for DFT codes in erasure channels is the class of iterative algorithms. Iterative algorithms can be considered as kind of alternating mapping methods using the given information in a repetitive way. In this paper, we propose a new iterative method for decoding DFT codes. It will be shown that the proposed method outperforms the well-known methods such as Wiley/Marvasti, and ADPW methods in the decoding of DFT codes in erasure channels. © Springer-Verlag 2004
  6. Keywords:
  7. Algorithms ; Iterative methods ; Codes (symbols)
  8. Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Volume 3124 , 2004 , Pages 548-553 ; 03029743 (ISSN); 3540225714 (ISBN); 9783540225713 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007/978-3-540-27824-5_74