Low-complexity list decoding of Reed-Solomon coded pulse position modulation

Vladimir Sidorenko, Robert Fischer

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)

Abstract

Reed-Solomon coded pulse position modulation- also known as the Kautz-Singleton code-found many applications in multiple access communications, in nonadaptive group testing, and in pooling designs in DNA mapping. Usually an exhaustive search was used to decode these codes which results in an exponential complexity in the code dimension. In this paper, a list decoding algorithm for the Kautz-Singleton codes based on the Guruswami-Sudan and Koetter-Vardy list decoding algorithms is presented. The analysis reveals that the algorithm has only polynomial complexity and is hence very well suited for low-complexity applications as they are desired, e.g., in ultrawideband communications.

Original languageEnglish
Title of host publicationProceedings of 2013 9th International ITG Conference on Systems, Communication and Coding, SCC 2013
PublisherVDE VERLAG GMBH
ISBN (Electronic)9783800734825
ISBN (Print)9783800734825
Publication statusPublished - 2013
Externally publishedYes
Event9th International ITG Conference on Systems, Communications and Coding, SCC 2013 - Munich, Germany
Duration: 21 Jan 201324 Jan 2013

Publication series

NameProceedings of 2013 9th International ITG Conference on Systems, Communication and Coding, SCC 2013

Conference

Conference9th International ITG Conference on Systems, Communications and Coding, SCC 2013
Country/TerritoryGermany
CityMunich
Period21/01/1324/01/13

Keywords

  • Disjunctive Channel
  • List Decoding
  • Pulse Position Modulation
  • Reed-Solomon Codes
  • Ultra-Wideband Communications

Fingerprint

Dive into the research topics of 'Low-complexity list decoding of Reed-Solomon coded pulse position modulation'. Together they form a unique fingerprint.

Cite this