Concept

Hamming bound

Related publications (45)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC

Rüdiger Urbanke, Shrinivas Kudekar

Convolutional LDPC ensembles, introduced by Felstrom and Zigangirov, have excellent thresholds and these thresholds are rapidly increasing as a function of the average degree. Several variations on the basic theme have been proposed to date, all of which s ...

IEEE2010

Network coding of correlated data with approximate decoding

Pascal Frossard, Nikolaos Thomos, Hyung Gon Park

We consider the problem of distributed delivery of correlated data from sensors in ad hoc network topologies. We propose to use network coding in order to exploit the path diversity in the network for efficient delivery of the sensor information. We furthe ...

2010

Integer-Forcing Linear Receivers

Michael Christoph Gastpar

complexity of multiple antenna systems. In a traditional linear receiver architecture, the receive antennas are used to separate out the codewords sent by each transmit antenna, which can then be decoded individually. Although easy to implement, this appro ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Polar Codes are Optimal for Lossy Source Coding

Rüdiger Urbanke, Satish Babu Korada

We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar codes achieve the capacity of arbitrary symmetric binary-input discrete mem ...

Institute of Electrical and Electronics Engineers2010

Linear Universal Decoder for Compound Discrete Memoryless Channels

Rethnakaran Pulikkoonattu

Shannon in his seminal work \cite{paper:shannon} formalized the framework on the problem of digital communication of information and storage. He quantified the fundamental limits of compression and transmission rates. The quantity \textit{channel capacity} ...

2009

Polar Codes are Optimal for Lossy Source Coding

Rüdiger Urbanke, Satish Babu Korada

We consider lossy source compression of a binary symmetric source with Hamming distortion function. We show that polar codes combined with a low-complexity successive cancellation encoding algorithm achieve the rate-distortion bound. The complexity of both ...

2009

Soft-output sphere decoding: Algorithms and VLSI implementation

Andreas Peter Burg, Christoph Studer

Multiple-input multiple-output (MIMO) detection algorithms providing soft information for a subsequent channel decoder pose significant implementation challenges due to their high computational complexity. In this paper, we show how sphere decoding can be ...

2008

Systems and processes for fast encoding of hamming codes

Mohammad Amin Shokrollahi

Decoding that uses an extended Hamming code in one of the primary stages of static encoding uses a calculation of the r+1 Hamming redundant symbols for k input symbols from which Hamming redundant symbols are calculated, where r satisfies 2.sup.r-1-r.ltore ...

2007

Cooperative source coding with encoder breakdown

Etienne Perron, Dinkar Vasudevan

This paper provides an inner bound to the rate-distortion region of a source coding setup in which two encoders are allowed some collaboration to describe a pair of discrete memoryless sources. We further require some robustness in case one of the encoders ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Good Ensembles of Goppa Codes

Ghid Maatouk

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