Publications related to Improved low-density parity-check codes using irregular graphs

Irregular Product Codes

Mohammad Amin Shokrollahi, Ghid Maatouk, Seyed Omid Etesami, Masoud Alipour Babaei

We introduce irregular product codes, a class of codes where each codeword is represented by a matrix and the entries in each row (column) of the matrix come from a component row (column) code. As opposed to standard product codes, we do not require that a ...

Ieee2012

A 2.78 mm2 65 nm CMOS Gigabit MIMO Iterative Detection and Decoding Receiver

Andreas Peter Burg

Iterative detection and decoding (IDD), combined with spatial-multiplexing multiple-input multiple-output (MIMO) transmission, is a key technique to improve spectral efﬁciency in wireless communications. In this paper we present the—to the best of our know ...

2012

Correlation-Aware Reconstruction of Network Coded Sources

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

In this paper, we consider the problem of decoding network coded correlated data when the decoder does not receive sufficient information for exact decoding. We propose an iterative decoding algorithm based on belief propagation that efficiently exploits t ...

2012

Analysis of the Second Moment of the LT Decoder

Mohammad Amin Shokrollahi, Ghid Maatouk

In this paper, the second moment of the ripple size during the Luby transform (LT) decoding process is analyzed. Combined with a result by Karp et al. (2004) stating that the expectation of the ripple size is of the order of k, our study gives bounds on th ...

2012

Is non-unique decoding necessary?

Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

In multi-terminal communication systems, signals carrying messages meant for different destinations are often observed together at any given destination receiver. Han and Kobayashi (1981) proposed a receiving strategy which performs a joint unique decoding ...

Ieee2012

Decay 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 ...

2011

Exchange of Limits: Why Iterative Decoding Works

Rüdiger Urbanke, Satish Babu Korada

We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes and message-passing decoding. The asymptotic (in the length) performance of such a combination for a fixed number of iterations is given b ...

2011

Exchange of Limits: Why Iterative Decoding Works

Rüdiger Urbanke, Satish Babu Korada

We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes and message-passing decoding. The asymptotic (in the length) performance of such a combination for a fixed number of iterations is given b ...

Institute of Electrical and Electronics Engineers2011

Compute-and-Forward: Harnessing Interference Through Structured Codes

Michael Christoph Gastpar

Abstract—Interference is usually viewed as an obstacle to communication in wireless networks. This paper proposes a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network. The key idea ...

Institute of Electrical and Electronics Engineers2011

Symbol-Pair Codes: Algebraic Constructions and Asymptotic Bounds

Yuval Cassuto

For the recently proposed model of symbol-pair channels, we advance the pair-error coding theory with algebraic cyclic-code constructions and asymptotic bounds on code rates. Cyclic codes for pair-errors are constructed by a careful use of duals of known t ...

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

Improved low-density parity-check codes using irregular graphs

Graph Chatbot

Chat with Graph Search

Irregular Product Codes

A 2.78 mm2 65 nm CMOS Gigabit MIMO Iterative Detection and Decoding Receiver

Correlation-Aware Reconstruction of Network Coded Sources

Analysis of the Second Moment of the LT Decoder

Is non-unique decoding necessary?

Decay of correlations for sparse graph error correcting codes

Exchange of Limits: Why Iterative Decoding Works

Exchange of Limits: Why Iterative Decoding Works

Compute-and-Forward: Harnessing Interference Through Structured Codes

Symbol-Pair Codes: Algebraic Constructions and Asymptotic Bounds

Correlation-Aware Reconstruction of Network Coded Sources

Decay of correlations for sparse graph error correcting codes

Irregular Product Codes

A 2.78 mm2 65 nm CMOS Gigabit MIMO Iterative Detection and Decoding Receiver

Compute-and-Forward: Harnessing Interference Through Structured Codes

Is non-unique decoding necessary?

Exchange of Limits: Why Iterative Decoding Works

Analysis of the Second Moment of the LT Decoder

Exchange of Limits: Why Iterative Decoding Works

Symbol-Pair Codes: Algebraic Constructions and Asymptotic Bounds