English
Related papers

Related papers: Strong Secrecy on the Binary Erasure Wiretap Chann…

200 papers

This paper considers density evolution for lowdensity parity-check (LDPC) and multi-edge type low-density parity-check (MET-LDPC) codes over the binary input additive white Gaussian noise channel. We first analyze three singleparameter…

Information Theory · Computer Science 2016-05-17 Sachini Jayasooriya , Mahyar Shirvanimoghaddam , Lawrence Ong , Gottfried Lechner , Sarah J. Johnson

Consider communication over a binary-input memoryless output-symmetric channel with low density parity check (LDPC) codes and maximum a posteriori (MAP) decoding. The replica method of spin glass theory allows to conjecture an analytic…

Information Theory · Computer Science 2016-11-17 Shrinivas Kudekar , Nicolas Macris

We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-density parity check (LDPC) code. Our first pair of theorems…

Information Theory · Computer Science 2007-07-13 Martin J. Wainwright , Emin Martinian

The performance of maximum-likelihood (ML) decoding on the binary erasure channel for finite-length low-density parity-check (LDPC) codes from two random ensembles is studied. The theoretical average spectrum of the Gallager ensemble is…

Information Theory · Computer Science 2018-11-21 Irina E. Bocharova , Boris D. Kudryashov , Vitaly Skachek , Eirik Rosnes , Øyvind Ytrehus

This paper is concerned with the design of capacity approaching ensembles of Low-Densiy Parity-Check (LDPC) codes for correlated sources. We consider correlated binary sources where the data is encoded independently at each source through a…

Information Theory · Computer Science 2017-01-30 Mohamad Khas Mohamadi , Hamid Saeedi , Reza Asvadi

A new method for analyzing low density parity check (LDPC) codes and low density generator matrix (LDGM) codes under bit maximum a posteriori probability (MAP) decoding is introduced. The method is based on a rigorous approach to spin…

Information Theory · Computer Science 2016-11-18 Andrea Montanari

Low-density parity-check (LDPC) codes are capable of achieving excellent performance and provide a useful alternative for high performance applications. However, at medium to high signal-to-noise ratios (SNR), an observable error floor…

Information Theory · Computer Science 2016-08-17 C. T. Healy , R. C. de Lamare

This paper describes an efficient implementation of binning for the relay channel using low-density parity-check (LDPC) codes. We devise bilayer LDPC codes to approach the theoretically promised rate of the decode-and-forward relaying…

Information Theory · Computer Science 2016-11-17 Peyman Razaghi , Wei Yu

We propose an Iterative Detection and Decoding (IDD) scheme with Low Density Parity Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems for block-fading $F = 2$ and fast fading Rayleigh channels. An IDD receiver with soft…

Information Theory · Computer Science 2014-04-09 A. G. D. Uchoa , C. T. Healy , R. C. de Lamare , P. Li

We show that polar codes asymptotically achieve the whole capacity-equivocation region for the wiretap channel when the wiretapper's channel is degraded with respect to the main channel, and the weak secrecy notion is used. Our coding…

Information Theory · Computer Science 2010-09-27 Mattias Andersson , Vishwambhar Rathi , Ragnar Thobaben , Joerg Kliewer , Mikael Skoglund

This paper presents an efficient algorithm for finding the dominant trapping sets of a low-density parity-check (LDPC) code. The algorithm can be used to estimate the error floor of LDPC codes or to be part of the apparatus to design LDPC…

Information Theory · Computer Science 2012-04-16 Mehdi Karimi , Amir H. Banihashemi

Moderate Density Parity Check (MDPC) codes are defined here as codes which have a parity-check matrix whose row weight is $O(\sqrt{n})$ where $n$ is the length $n$ of the code. They can be decoded like LDPC codes but they decode much less…

Information Theory · Computer Science 2018-01-16 Jean-Pierre Tillich

In this paper we study the iterative decoding threshold performance of non-binary spatially-coupled low-density parity-check (NB-SC-LDPC) code ensembles for both the binary erasure channel (BEC) and the binary-input additive white Gaussian…

Information Theory · Computer Science 2016-11-18 Lai Wei , Toshiaki Koike-Akino , David G. M. Mitchell , Thomas E. Fuja , Daniel J. Costello

In this paper, a simple, general-purpose and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method consists in starting from the parity-check…

Information Theory · Computer Science 2008-10-08 E. Paolini , M. Chiani

Classical low-density parity-check (LDPC) codes are a widely deployed and well-established technology, forming the backbone of modern communication and storage systems. It is well known that, in this classical setting, increasing the girth…

Quantum Physics · Physics 2026-01-21 Kenta Kasai

This paper presents a combinatorial construction of low-density parity-check (LDPC) codes from difference covering arrays. While the original construction by Gallagher was by randomly allocating bits in a sparse parity-check matrix, over…

Combinatorics · Mathematics 2017-01-23 D. Donovan , A. Rao , E. Şule Yazıcı

We study a problem of constructing codes that transform a channel with high bit error rate (BER) into one with low BER (at the expense of rate). Our focus is on obtaining codes with smooth ("graceful'') input-output BER curves (as opposed…

Information Theory · Computer Science 2019-11-28 Hajir Roozbehani , Yury Polyanskiy

Low-density parity-check (LDPC) codes are specified by graphs, and are the error correction technique of choice in many communications and data storage contexts. Message passing decoders diffuse information carried by parity bits into the…

Information Theory · Computer Science 2023-05-02 Beyza Dabak , Ece Tiryaki , Robert Calderbank , Ahmed Hareedy

We derive bounds on the asymptotic density of parity-check matrices and the achievable rates of binary linear block codes transmitted over memoryless binary-input output-symmetric (MBIOS) channels. The lower bounds on the density of…

Information Theory · Computer Science 2007-07-13 Gil Wiechman , Igal Sason

This paper presents new FEC codes for the erasure channel, LDPC-Band, that have been designed so as to optimize a hybrid iterative-Maximum Likelihood (ML) decoding. Indeed, these codes feature simultaneously a sparse parity check matrix,…

Information Theory · Computer Science 2009-01-23 Alexandre Soro , Mathieu Cunche , Jerome Lacan , Vincent Roca
‹ Prev 1 3 4 5 6 7 10 Next ›