Publications related to From Polar to Reed-Muller Codes: a Technique to Improve the Finite-Length Performance

Good Ensembles of Goppa Codes

It is well-known that random error-correcting codes achieve the Gilbert-Varshamov bound with high probability. In [2], the authors describe a construction which can be used to yield a polynomially large family of codes of which a large fraction achieve the ...

2007

Channel coding and modulation based on chaotic systems

Slobodan Kozic

In this thesis, a new class of codes on graphs based on chaotic dynamical systems are proposed. In particular, trellis coded modulation and iteratively decodable codes on graphs are studied. The codes are designed by controlling symbolic dynamics of chaoti ...

EPFL2006

Computational Hardness and Explicit Constructions of Error Correcting Codes

Mohammad Amin Shokrollahi, Mahdi Cheraghchi Bashi Astaneh

We outline a procedure for using pseudorandom generators to construct binary codes with good properties, assuming the existence of sufficiently hard functions. Specifically, we give a polynomial time algorithm, which for every integers

n

and

k

, constru ...

2006

Joint source-channel coding with feedback

Communications is about conveying information from one point to another subject to certain performance constraints. The information is assumed to be generated by a source and may, for example, represent a voice waveform, the reading of a thermal sensor, or ...

EPFL2005

Asymptotic and finite-length analysis of low-density parity-check codes

Changyan Di

This thesis addresses the topic of Low-Density Parity-Check (LDPC) code analysis, both asymptotically and for finite block lengths. Since in general it is a difficult problem to analyze individual code instances, ensemble averages are studied by following ...

EPFL2004

Algebraic-geometric codes on the erasure channel

Mohammad Amin Shokrollahi, Andrew Brown

This paper investigates the use of algebraic-geometric codes for data transmission over a packet network, by comparing their encoding/decoding speeds to those of the ubiquitous Reed-Solomon Codes. We take advantage of the fact that AG codes allow the const ...

2004

Undetection error probability of linear and alternating-phase codes over the timing error channel

Paolo Ienne, Patrick Thiran, Frédéric Worm

We develop a channel model for errors originated from over-aggressive operation of a communication link. Such a situation arises in the context of on-chip self-calibrating communication, where a link controller has to determine adaptively the operating vol ...

2004

Low-delay low-complexity error-correcting codes on sparse graphs

Xiao-Yu Hu

This dissertation presents a systematic exposition on finite-block-length coding theory and practice. We begin with the task of identifying the maximum achievable rates over noisy, finite-block-length constrained channels, referred to as (ε, n)-capacity Cε ...

EPFL2003

Finite-length analysis of various low-density parity-check ensembles for the binary erasure channel

Rüdiger Urbanke, Mohammad Amin Shokrollahi

We investigate the average erasure probability of the belief propagation algorithm over the binary erasure channel (BEC) for various finite-length low- density parity-check (LDPC) ensembles. In particular, we give tight upper bounds on the "error floor", i ...

2002

To Code, Or Not To Code: On the Optimality of Symbol-by-Symbol Communication

Martin Vetterli, Michael Christoph Gastpar, Bixio Rimoldi

When is uncoded transmission optimal? This paper derives easy-to-check necessary and sufficient conditions that do not require finding the rate-distortion and the capacity-cost functions. We consider the symbol-by-symbol communication of discrete-time memo ...

2001

From Polar to Reed-Muller Codes: a Technique to Improve the Finite-Length Performance

Graph Chatbot

Chat with Graph Search

Good Ensembles of Goppa Codes

Channel coding and modulation based on chaotic systems

Computational Hardness and Explicit Constructions of Error Correcting Codes

Joint source-channel coding with feedback

Asymptotic and finite-length analysis of low-density parity-check codes

Algebraic-geometric codes on the erasure channel

Undetection error probability of linear and alternating-phase codes over the timing error channel

Low-delay low-complexity error-correcting codes on sparse graphs

Finite-length analysis of various low-density parity-check ensembles for the binary erasure channel

To Code, Or Not To Code: On the Optimality of Symbol-by-Symbol Communication

Undetection error probability of linear and alternating-phase codes over the timing error channel

Channel coding and modulation based on chaotic systems

Good Ensembles of Goppa Codes

Computational Hardness and Explicit Constructions of Error Correcting Codes

Joint source-channel coding with feedback

Asymptotic and finite-length analysis of low-density parity-check codes

Algebraic-geometric codes on the erasure channel

Finite-length analysis of various low-density parity-check ensembles for the binary erasure channel

Low-delay low-complexity error-correcting codes on sparse graphs

To Code, Or Not To Code: On the Optimality of Symbol-by-Symbol Communication