Publication
On the use of training sequences for channel estimation
Related publications (37)
Lattice Codes for Many-to-One Interference Channels With and Without Cognitive Messages
Michael Christoph Gastpar, Jingge Zhu
A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of codewords, our scheme im ...
Institute of Electrical and Electronics Engineers2015Extremal Channels of Gallager's E-0 Under the Basic Polarization Transformations
We study the extremality of the binary erasure channel and the binary symmetric channel for Gallager's reliability function E-0 of binary input discrete memoryless channels evaluated under the uniform input distribution from the aspect of channel polarizat ...
Institute of Electrical and Electronics Engineers2014Finite-Length Scaling for Polar Codes
Rüdiger Urbanke, Seyed Hamed Hassani
Consider a binary-input memoryless output-symmetric channel W. Such a channel has a capacity, call it I (W), and for any R < I (W) and strictly positive constant P-e we know that we can construct a coding scheme that allows transmission at rate R with an e ...
Ieee-Inst Electrical Electronics Engineers Inc2014Scaling 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 ...
Ieee2013Polar Codes: Finite Length Implementation, Error Correlations and Multilevel Modulation
Shannon, in his seminal work, formalized the transmission of data over a communication channel and determined its fundamental limits. He characterized the relation between communication rate and error probability and showed that as long as the communicatio ...
2012Polar Coding Theorems for Discrete Systems
Polar coding is a recently invented technique for communication over binary-input memoryless channels. This technique allows one to transmit data at rates close to the symmetric-capacity of such channels with arbitrarily high reliability, using low-complex ...
EPFL2011Phase Transitions for Mutual Information
Mohammad Amin Shokrollahi, Krishna Kumar, Amir Hesam Salavati, Raj Kumar Krishna Kumar
We consider ensembles of binary linear error correcting codes, obtained by sampling each column of the generator matrix G or parity check matrix H independently from the set of all binary vectors of weight d (of appropriate dimension). We investigate the c ...
IEEE2010Zero-Rate Feedback Can Achieve the Empirical Capacity
The utility of limited feedback for coding over an individual sequence of discrete memoryless channels is investigated. This study complements recent results showing how limited or noisy feedback can boost the reliability of communication. A strategy with ...
2010Linear Universal Decoder for Compound Discrete Memoryless Channels
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} ...
2009Source and channel coding using Fountain codes
The invention of Fountain codes is a major advance in the field of error correcting codes. The goal of this work is to study and develop algorithms for source and channel coding using a family of Fountain codes known as Raptor codes. From an asymptotic poi ...
EPFL2009