Finite-length analysis of various low-density parity-check ensembles for the binary erasure channel
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.
In this paper we describe some practical aspects of the design process of good Raptor codes for finite block lengths over arbitrary binary input symmetric channels. In particular we introduce a simple model for the finite-length convergence behavior of the ...
Fountain codes have been successfully employed for reliable and efficient transmission of information via erasure channels with unknown erasure rates. This paper introduces the notion of fountain capacity for arbitrary channels, and shows that it is equal ...
In this paper, we describe one solution to the two-user Slepian-Wolf problem in a certain part of the achievable region using fountain codes. Symmetric case of memoryless compression of two correlated sources is considered and modeled by a BSC channel. The ...
In this paper we present a rapid review of known results in the context of different scenario of the erasure channel. We will also give a converse capacity bound for relay channel showing that the cut-set bound is not attainable in general by any fixed cod ...
In this paper a class of discretized piecewise linear chaotic maps of a very high dimensions are used for communication over a noisy channel. An information payload that is sent over a channel is controlled in the transmitter and is related to the symbolic ...
Suppose Q is a family of discrete memoryless channels. An unknown member of Q will be available, with perfect, causal output feedback for communication. We study a scenario where communication is carried by first testing the channel by means of a training ...
We consider in this paper a network that consists of two senders and two receivers. We further assume that each sender could act as a relay for other communications. All channels connecting these nodes are supposed to be erasure channels where symbols are ...
We consider communication over a time-invariant discrete memoryless channel (DMC) with noiseless and instantaneous feedback. We assume that the transmitter and the receiver are not aware of the underlying channel, however, they know that it belongs to some ...
We consider communication over a time invariant discrete memoryless channel with noiseless and instantaneous feedback. We assume that the communicating parties are not aware of the underlying channel, however they know that it belongs to some specific fami ...
Suppose Q is a family of discrete memoryless channels. An unknown member of Q is available with perfect (causal) feedback for communication. A recent result (A. Tchamkerten and I.E. Telatar) shows the existence, for certain families of channels (e.g. binar ...
