English
Related papers

Related papers: Polarized Low-Density Parity-Check Codes on the BS…

200 papers

A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity $I(W)$ of any given binary-input discrete memoryless channel (B-DMC) $W$. The symmetric capacity is the highest rate…

Information Theory · Computer Science 2016-11-18 Erdal Arikan

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

In this paper we consider the generalization of binary spatially coupled low-density parity-check (SC-LDPC) codes to finite fields GF$(q)$, $q\geq 2$, and develop design rules for $q$-ary SC-LDPC code ensembles based on their iterative…

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

Quantum low-density parity-check (QLDPC) codes provide a practical balance between error-correction capability and implementation complexity in quantum error correction (QEC). In this paper, we propose an algebraic construction based on…

Information Theory · Computer Science 2026-01-14 Alessio Baldelli , Massimo Battaglioni , Jonathan Mandelbaum , Sisi Miao , Laurent Schmalen

This paper presents a design technique for obtaining regular time-invariant low-density parity-check convolutional (RTI-LDPCC) codes with low complexity and good performance. We start from previous approaches which unwrap a low-density…

Information Theory · Computer Science 2016-11-17 Marco Baldi , Giovanni Cancellieri , Franco Chiaraluce

A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are described by protographs, comprised of several protograph-based chains characterizing individual…

Information Theory · Computer Science 2016-11-18 Dmitri Truhachev , David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing…

Information Theory · Computer Science 2019-07-09 Laurent Schmalen , Vahid Aref

Digital data transfer can be protected by means of suitable error correcting codes. Among the families of state-of-the-art codes, LDPC (Low Density Parity-Check) codes have received a great deal of attention recently, because of their…

Information Theory · Computer Science 2022-10-10 Massimo Battaglioni , Giovanni Cancellieri

We investigate the use of Gallager's low-density parity-check (LDPC) codes in a broadcast channel, one of the fundamental models in network information theory. Combining linear codes is a standard technique in practical network…

Statistical Mechanics · Physics 2009-11-07 Kazutaka Nakamura , Robert Morelos-Zaragoza , David Saad , Yoshiyuki Kabashima

We present a theoretical method for a direct evaluation of the average and reliability error exponents in low-density parity-check error-correcting codes using methods of statistical physics. Results for the binary symmetric channel (BSC)…

Disordered Systems and Neural Networks · Physics 2016-08-31 N. S. Skantzos , J. van Mourik , D. Saad , Y. Kabashima

In this paper, we present an efficient algorithm to sample random sparse matrices to be used as check matrices for quantum Low-Density Parity-Check (LDPC) codes. To ease the treatment, we mainly describe our algorithm as a technique to…

Information Theory · Computer Science 2026-01-27 Paolo Santini

Low Density Parity Check (LDPC) codes are linear error correcting codes used in communication systems for Forward Error Correction (FEC). But, intensive computation is required for encoding and decoding of LDPC codes, making it difficult…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-01-13 Bhargav Gokalgandhi , Ivan Seskar

One approach to designing structured low-density parity-check (LDPC) codes with large girth is to shorten codes with small girth in such a manner that the deleted columns of the parity-check matrix contain all the variables involved in…

Discrete Mathematics · Computer Science 2016-11-18 Olgica Milenkovic , Navin Kashyap , David Leyba

Recently, a new class of error-control codes, the polar codes, have attracted much attention. The polar codes are the first known class of capacity-achieving codes for many important communication channels. In addition, polar codes have…

Information Theory · Computer Science 2012-11-19 Xudong Ma

Previous work showed that polar codes can be decoded using off-the-shelf LDPC decoders by imposing special constraints on the LDPC code structure, which, however, resulted in some performance degradation. In this paper we show that this…

Information Theory · Computer Science 2019-09-27 Moustafa Ebada , Ahmed Elkelesh , Stephan ten Brink

A joint scheme for the channel coding and spectrum spreading communication system is proposed in this paper. The Bit Error Rate (BER) performance of the joint proposed scheme is evaluated and compared with the case of channel coding scheme…

Information Theory · Computer Science 2021-08-24 Hadi Khodaei Jooshin , Mahdi Nangir

Spatially Coupled Low-Density Parity-Check (SC-LDPC) codes offer excellent decoding performance and can be elegantly decoded with a Windowed Decoder (WD). We determine an efficient WD configuration with low control overhead. For fair…

Signal Processing · Electrical Eng. & Systems 2020-04-28 Janik Frenzel , Stefan Müller-Weinfurtner , Johannes Huber , Ralf Müller

Recently introduced Fair-Density Parity-Check (FDPC) codes, targeting high-rate applications, offer superior error-correction performance (ECP) compared to 5G Low-Density Parity-Check (LDPC) codes, given the same number of message-passing…

Information Theory · Computer Science 2025-06-16 Mohsen Moradi , Sheida Rabeti , Hessam Mahdavifar

This paper develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit constructions are given for entanglement-assisted quantum…

Information Theory · Computer Science 2012-08-28 Yuichiro Fujiwara , David Clark , Peter Vandendriessche , Maarten De Boeck , Vladimir D. Tonchev

We discuss error floor asympotics and present a method for improving the performance of low-density parity check (LDPC) codes in the high SNR (error floor) region. The method is based on Tanner graph covers that do not have trapping sets…

Information Theory · Computer Science 2008-05-13 Milos Ivkovic Shashi Kiran Chilappagari Bane Vasic
‹ Prev 1 4 5 6 7 8 10 Next ›