Publication

On source/channel codes of finite block length

Martin Vetterli, Michael Christoph Gastpar, Bixio Rimoldi
2001
Conference Papers

Abstract

For certain fortunate choices of source/channel pairs, all sophisticated coding is in vain: for them, a code of block length one is sufficient to achieve optimal performance \cite{mgbrmvtrans}. Is the set of ``fortunate choices'' larger if we allow for codes of block length $M$ ? For a certain class of discrete memoryless source/channel pairs, we can prove that the answer is negative as long as $M$ is finite.

Official source

https://infoscience.epfl.ch/entities/publication/4cd19939-c426-4908-9fd9-ffb3e156c4fe

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

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.

Martin Vetterli, Michael Christoph Gastpar, Bixio Rimoldi
2001
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/4cd19939-c426-4908-9fd9-ffb3e156c4fe

About this result

Related concepts (10)

Block code

In coding theory, block codes are a large and important family of error-correcting codes that encode data in blocks. There is a vast number of examples for block codes, many of which have a wide range of practical applications. The abstract definition of block codes is conceptually useful because it allows coding theorists, mathematicians, and computer scientists to study the limitations of all block codes in a unified way.

Noisy-channel coding theorem

In information theory, the noisy-channel coding theorem (sometimes Shannon's theorem or Shannon's limit), establishes that for any given degree of noise contamination of a communication channel, it is possible to communicate discrete data (digital information) nearly error-free up to a computable maximum rate through the channel. This result was presented by Claude Shannon in 1948 and was based in part on earlier work and ideas of Harry Nyquist and Ralph Hartley.

Error correction code

In computing, telecommunication, information theory, and coding theory, forward error correction (FEC) or channel coding is a technique used for controlling errors in data transmission over unreliable or noisy communication channels. The central idea is that the sender encodes the message in a redundant way, most often by using an error correction code or error correcting code (ECC). The redundancy allows the receiver not only to detect errors that may occur anywhere in the message, but often to correct a limited number of errors.

Related publications (3)

On source/channel codes of finite block length

Chat with Graph Search

Lossless Source Coding with Polar Codes

Real-time Delay with Network Coding and Feedback

Low-density parity-check codes with rates very close to the capacity of the q-ary symmetric channel for large q