Skip to search formSkip to main contentSkip to account menu

List decoding

Known as: List-decoding 
In computer science, particularly in coding theory, list decoding is an alternative to unique decoding of error-correcting codes for large error… 
Wikipedia (opens in a new tab)

Related topics

Related topics

21 relations
Alexander VardyAnalysis of algorithmsBinary symmetric channelBlock code

Broader (1)

Error detection and correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A Novel Interleaving Scheme for Polar Codes
It's known that the bit errors of polar codes with successive cancellation (SC) decoding are coupled. We call the coupled… 
2015
2015
OPTIMIZATION OF RESOURCE CONSTRAINED PROJECT SCHEDULES BY GENETIC ALGORITHM BASED ON THE JOB PRIORITY LIST
Applications of information technologies are often related to making some schedules, timetables of tasks or jobs with constrained… 
2013
2013
Polynomial Representations of Polar Codes and Decoding under Overcomplete Representations
This letter proposes an alternative expression of polar codes using polynomial representations. Polynomial representations may… 
Review
2011
Review
2011
VLSI Design for Low-Density Parity-Check Code Decoding
Low-Density Parity-check (LDPC) code, being one of the most promising near-Shannon limit error correction codes (ECCs) in… 
Review
2009
Review
2009
The BMS Algorithm and Decoding of AG Codes
  • S. Sakata
  • Gröbner Bases, Coding, and Cryptography
  • 2009
  • Corpus ID: 86865712
In this paper, we review various decoding methods of algebraic geometry (or algebraic-geometric) codes (Goppa in Soviet Math… 
2008
2008
Fixed-Rate Raptor Codes Over Rician Fading Channels
This paper considers the newly introduced fountain codes for fixed-rate error control coding, with emphasis on Raptor codes. The… 
2007
2007
A decoding method up to the hartmann-tzeng bound using the DFT for cyclic codes
We consider a decoding method for cyclic codes up to the Hartmann-Tzeng bound using the discrete Fourier transform. Indeed we… 
2006
2006
Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded Alphabets
We define a new family of error-correcting codes based on algebraic curves over finite fields, and develop efficient list… 
2003
2003
Unitary space-time trellis codes
In this paper, a new noncoherent space-time coding scheme for the quasistatic flat fading channel is proposed. The proposed codes… 
2002
2002
Soft-decision Reed-Solomon decoding on partial response channels
We compare the performance of list-type soft-decision Reed-Solomon (RS) decoding algorithms to that of classical hard-decision RS… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)