liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Aspects of List-of-Two Decoding
Linköping University, Department of Electrical Engineering, Data Transmission . Linköping University, The Institute of Technology.
2006 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

We study the problem of list decoding with focus on the case when we have a list size limited to two. Under this restriction we derive general lower bounds on the maximum possible size of a list-of-2-decodable code. We study the set of correctable error patterns in an attempt to obtain a characterization. For a special family of Reed-Solomon codes - which we identify and name 'class-I codes' - we give a weight-based characterization of the correctable error patterns under list-of-2 decoding. As a tool in this analysis we use the theoretical framework of Sudan's algorithm. The characterization is used in an exact calculation of the probability of transmission error in the symmetric channel when list-of-2 decoding is used. The results from the analysis and complementary simulations for QAM-systems show that a list-of-2 decoding gain of nearly 1 dB can be achieved.

Further we study Sudan's algorithm for list decoding of Reed-Solomon codes for the special case of the class-I codes. For these codes algorithms are suggested for both the first and second step of Sudan's algorithm. Hardware solutions for both steps based on the derived algorithms are presented.

Place, publisher, year, edition, pages
Institutionen för systemteknik , 2006. , 124 p.
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1010
Keyword [en]
list decoding, Sudan's algorithm, Reed-Solomon code
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:liu:diva-6919ISBN: 91-85497-49-5 (print)OAI: oai:DiVA.org:liu-6919DiVA: diva2:22047
Public defence
2006-05-12, Key1, Key, Linköpings universitet, Linköping, 13:15 (English)
Opponent
Supervisors
Available from: 2006-06-28 Created: 2006-06-28

Open Access in DiVA

fulltext(1081 kB)645 downloads
File information
File name FULLTEXT01.pdfFile size 1081 kBChecksum MD5
062d0f59e8690dfa69899f4643cc7099a4a3d48c0c092a3679e079f07352e7ae92b470fc
Type fulltextMimetype application/pdf

Authority records BETA

Eriksson, Jonas

Search in DiVA

By author/editor
Eriksson, Jonas
By organisation
Data Transmission The Institute of Technology
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 645 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 1683 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf