Publication
Block copolymers and uses thereof
Related publications (41)
How to Prove the Maxwell Conjecture Via Spatial Coupling - A Proof of Concept
Rüdiger Urbanke, Nicolas Macris, Andrei Giurgiu
Investigations on spatially coupled codes have lead to the conjecture that, in the infinite size limit, the average input-output conditional entropy for spatially coupled low-density parity-check ensembles, over binary memoryless symmetric channels, equals ...
Ieee2012Decay of correlations for sparse graph error correcting codes
Nicolas Macris, Shrinivas Kudekar
The subject of this paper is transmission over a general class of binary-input memoryless symmetric channels using error correcting codes based on sparse graphs, namely, low-density generator-matrix and low-density parity-check codes. The optimal (or ideal ...
2011Efficient Implementation of Linear Programming Decoding
While linear programming (LP) decoding provides more flexibility for finite-length performance analysis than iterative message-passing (IMP) decoding, it is computationally more complex to implement in its original form, due to both the large size of the r ...
2011Phase 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 ...
IEEE2010A 15.8 pJ/bit/iter quasi-cyclic LDPC decoder for IEEE 802.11n in 90 nm CMOS
Andreas Peter Burg, Pascal Andreas Meinerzhagen, Christoph Studer
We present a low-power quasi-cyclic (QC) low density parity check (LDPC) decoder that meets the throughput requirements of the highest-rate (600 Mbps) modes of the IEEE 802.11n WLAN standard. The design is based on the layered offset-min-sum algorithm and ...
IEEE2010Linear 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} ...
2009Polar codes for channel and source coding
The two central topics of information theory are the compression and the transmission of data. Shannon, in his seminal work, formalized both these problems and determined their fundamental limits. Since then the main goal of coding theory has been to find ...
EPFL2009On communication over discrete memoryless channels with noiseless feedback
The addition of a feedback link to a discrete memoryless channel does not increase its capacity, but it does bring with it other benefits. One of these benefits is an increase to the best achievable error exponent. In the first part of this thesis we revis ...
EPFL2008Decay 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 ...
IEEE2008Protection of data from erasures using subsymbol based codes
An encoder uses output symbol subsymbols to effect or control a tradeoff of computational effort and overhead efficiency to, for example, greatly reduce computational effort for the cost of a small amount of overhead efficiency. An encoder reads an ordered ...
2008