Concept

Binary symmetric channel

Related publications (176)

Fountain codes for piecewise stationary channels

Mohammad Amin Shokrollahi, Bertrand Ndzana Ndzana

In this paper, two fixed per-information symbol complexity lossless source coding algorithms are modified for estimation and incremental LT decoding over piecewise stationary memoryless channels (PSMC's) with a bounded number of abrupt changes in channel s ...

IEEE2008

The case for structured random codes in network capacity theorems

Michael Christoph Gastpar

Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for proving some network capacity theorems: structured coding arguments, such as ran ...

2008

Online Broadcasting with Network Coding

Christina Fragouli, Lorenzo Keller

Consider a source broadcasting M packets to N receivers over independent erasure channels, where perfect feedback is available from the receivers to the source, and the source is allowed to use coding. We investigate offline and online algorithms that opti ...

2008

Finite-length scaling of repeat-accumulate codes on the BEC

In this paper we consider the finite-length performance of Repeat-Accumulate codes in the waterfall region assuming the transmission on the binary erasure channel. We extend the finite-length scaling law of LDPC codes [1] to this ensemble and we derive the ...

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

Structured random codes and sensor network coding theorems

Michael Christoph Gastpar

In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is usually established via a two-stage approach: The sources are compressed into bits, and these bits are reliably communicated across the noisy channels. Random codin ...

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

Decay of Correlations: An Application to Low-Density Parity Check codes

Nicolas Macris, Shrinivas Kudekar

Recently the decay of correlations between bits of low density generator matrix (LDGM) codes have been investigated by using high temperature expansions from statistical physics \cite{KuMa07}. In this work we apply these ideas to a special class of low den ...

IEEE2008

On the Minimum Distance of Non Binary LDPC Codes

Rethnakaran Pulikkoonattu

Minimum distance is an important parameter of a linear error correcting code. For improved performance of binary Low Density Parity Check (LDPC) codes, we need to have the minimum distance grow fast with n, the codelength. However, the best we can hope for ...

2008

Finite-Length Scaling of Parallel Turbo Codes on the BEC

In this paper we consider the finite-length performance of turbo codes in the waterfall region assuming the transmission on the binary erasure channel. We extend the finite-length scaling law of LDPC codes [1] and of Repeat-Accumulate codes [3] to this ens ...

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

Error Resiliency of Distributed Video Coding in Wireless Video Communication

Touradj Ebrahimi, Frédéric Dufaux, Mourad Ouaret, Michael Ansorge

Distributed Video Coding (DVC) is a new paradigm in video coding, based on the Slepian-Wolf and Wyner-Ziv theorems. DVC offers a number of potential advantages: flexible partitioning of the complexity between the encoder and decoder, robustness to channel ...

SPIE2008

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

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.