Results 21 to 30 of about 2,435,702 (285)
ACM SIGACT News, 2000 Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged between the two topics in the recent years. This connection is centered around the notion of “list-decoding” for error-correcting codes. In this survey we describe the list-decoding
openaire +3 more sources
Bidirectional fano algorithm for high throughput sequential decoding [PDF]
, 2009 Various techniques, such as bidirectional search, have been employed in sequential decoding to reduce the decoding delay. In this paper, a idirectional Fano algorithm (BFA) is proposed, in which a forward decoder (FD) and a backward decoder (BD) search ...
Koçak, T +8 more
core +1 more source
A Low-latency Successive Cancellation List Decoding Algorithm for Polar Codes [PDF]
Jisuanji gongcheng, 2018 In order to further reduce the decoding delay,a low-latency adaptive Successive Cancellation List(SCL) decoding algorithm based on path reuse is proposed.A repeated path replicating scheme based on CRC check is adopted for the phenomenon that there is a ...
LIU Yajun,LI Shibao,LIU Jianhang,CHEN Haihua
doaj +1 more source
Simple algorithms for BCH decoding [PDF]
IEEE Transactions on Communications, 1995 Summary: Some simple algorithms for decoding BCH codes are proposed. We show that the pruned FFT is an effective method for evaluating syndromes and for finding the roots of error-locator polynomials. We show that a simple variation of the basic Gaussian elimination procedure can be adapted to compute the error-locator polynomial efficiently for codes ...
Jonathan Hong, Martin Vetterli
openaire +3 more sources
A Decoding Algorithm for LDPC Codes Over Erasure Channels with Sporadic Errors [PDF]
, 2010 An efficient decoding algorithm for low-density parity-check (LDPC) codes on erasure channels with sporadic errors (i.e., binary error-and-erasure channels with error probability much smaller than the erasure probability) is proposed and its performance ...
Paolini, Enrico +9 more
core +1 more source
Iterative source and channel decoding relying on correlation modelling for wireless video transmission [PDF]
, 2013 Since joint source-channel decoding (JSCD) is capable of exploiting the residual redundancy in the source signals for improving the attainable error resilience, it has attracted substantial attention.
Wang, Tao +3 more
core +1 more source
Viterbi decoding strategies for 5 GHz wireless LAN systems [PDF]
, 2001 Standards for the operation of wireless local area network (WLAN) technology in the 5 GHz band have been developed in Europe, North America and Japan. These systems employ orthogonal frequency division multiplexing (OFDM) technology, and utilize forward ...
Nix, AR +4 more
core +1 more source
List-Decoding Algorithms for Lifted Codes [PDF]
IEEE Transactions on Information Theory, 2016 15 pages, no figures.
Alan Guo, Swastik Kopparty
openaire +3 more sources
Graph-Based Codes and Iterative Decoding [PDF]
, 2003 The field of error correcting codes was revolutionized by the introduction of turbo codes in 1993. These codes demonstrated dramatic performance improvements over any previously known codes, with significantly lower complexity.
Khandekar, Aamod Dinkar
core +1 more source
A minimax robust decoding algorithm
IEEE Transactions on Information Theory, 2000 We study the decoding problem in an uncertain noise environment. If the receiver knows the noise probability density function (PDF) at each time slot or its a priori probability, the standard Viterbi (1967) algorithm (VA) or the a posteriori probability (APP) algorithm can achieve optimal performance.
Wei, Lei +3 more
openaire +4 more sources