Publications associées à Capacity-approaching codes on the q-ary symmetric channel for large q

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

LDPC Codes for 2D Arrays

Mohammad Amin Shokrollahi, Yuval Cassuto

Binary codes over 2D arrays are very useful in data storage, where each array column represents a storage device or unit that may suffer failure. In this paper, we propose a new framework for probabilistic construction of codes on 2D arrays. Instead of a p ...

Institute of Electrical and Electronics Engineers2014

Linear Programming Decoding of Spatially Coupled Codes

Rüdiger Urbanke, Badih Ghazi

For a given family of spatially coupled codes, we prove that the linear programming (LP) threshold on the binary-symmetric channel (BSC) of the tail-biting graph cover ensemble is the same as the LP threshold on the BSC of the derived spatially coupled ens ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Is non-unique decoding necessary?

Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

In multi-terminal communication systems, signals carrying messages meant for different destinations are often observed together at any given destination receiver. Han and Kobayashi (1981) proposed a receiving strategy which performs a joint unique decoding ...

Institute of Electrical and Electronics Engineers2014

Scaling Exponent of List Decoders with Applications to Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Motivated by the significant performance gains which polar codes experience when they are decoded with successive cancellation list decoders, we study how the scaling exponent changes as a function of the list size L. In particular, we fix the block error ...

Ieee2013

Polar Codes For Broadcast Channels

Michael Christoph Gastpar, Emmanuel Abbé, Naveen Goela

Building on polar code constructions proposed by the authors for deterministic broadcast channels, two theorems are introduced in the present paper for noisy two-user broadcast channels. The theorems establish polar code constructions for two important ...

2013

Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation

Rüdiger Urbanke, Shrinivas Kudekar

We investigate spatially coupled code ensembles. For transmission over the binary erasure channel, it was recently shown that spatial coupling increases the belief propagation threshold of the ensemble to essentially the maximum a priori threshold of the u ...

Institute of Electrical and Electronics Engineers2013

Comments on "Iterative channel decoding of FEC-based multiple-description codes"

Nikolaos Thomos

In their recent paper, Chang et al. presented a method for iterative decoding of FEC-based multiple description codes in image transmission. In this correspondence we clarify that an outer interleaver used in the above work was previously proposed for the ...

Institute of Electrical and Electronics Engineers2013

Displacement Convexity - A Useful Framework for the Study of Spatially Coupled Codes

Rüdiger Urbanke, Nicolas Macris, Rafah El-Khatib

Spatial coupling has recently emerged as a powerful paradigm to construct graphical models that work well under low-complexity message-passing algorithms. Although much progress has been made on the analysis of spatially coupled models under message passin ...

Ieee2013

Capacity-approaching codes on the q-ary symmetric channel for large q

Graph Chatbot

Chattez avec Graph Search

LDPC Codes for 2D Arrays

Linear Programming Decoding of Spatially Coupled Codes

Is non-unique decoding necessary?

Generalized Codes on Graphs and Applications in Content Distribution

Scaling Exponent of List Decoders with Applications to Polar Codes

Polar Codes For Broadcast Channels

A Class of Generalized RS-Codes with Faster Encoding and Decoding Algorithms

Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation

Comments on "Iterative channel decoding of FEC-based multiple-description codes"

Displacement Convexity - A Useful Framework for the Study of Spatially Coupled Codes

LDPC Codes for 2D Arrays

Scaling Exponent of List Decoders with Applications to Polar Codes

Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation

Is non-unique decoding necessary?

Linear Programming Decoding of Spatially Coupled Codes

Generalized Codes on Graphs and Applications in Content Distribution

Polar Codes For Broadcast Channels

A Class of Generalized RS-Codes with Faster Encoding and Decoding Algorithms

Comments on "Iterative channel decoding of FEC-based multiple-description codes"

Displacement Convexity - A Useful Framework for the Study of Spatially Coupled Codes