English
Related papers

Related papers: A Refined Scaling Law for Spatially Coupled LDPC C…

200 papers

We propose an approach for optimizing nonbinary (NB) quasi-cyclic (QC) LDPC codes. This approach combines constructing of base parity-check matrices by simulated annealing and labeling the obtained base matrices aimed at maximizing the…

Information Theory · Computer Science 2020-10-23 Irina E. Bocharova , Boris D. Kudryashov , Evgenii P. Ovsyannikov , Vitaly Skachek , Tähvend Uustalu

This paper investigates the application of low-density parity-check (LDPC) codes to Flash memories. Multiple cell reads with distinct word-line voltages provide limited-precision soft information for the LDPC decoder. The values of the…

Information Theory · Computer Science 2012-10-02 Jiadong Wang , Guiqiang Dong , Thomas Courtade , Hari Shankar , Tong Zhang , Richard Wesel

Quantum cryptography via key distribution mechanisms that utilize quantum entanglement between sender-receiver pairs will form the basis of future large-scale quantum networks. A key engineering challenge in such networks will be the…

Information Theory · Computer Science 2015-05-14 Yixuan Xie , Jun Li , Robert Malaney , Jinhong Yuan

In this paper, we compare the finite-length performance of protograph-based spatially coupled low-density parity-check (SC-LDPC) codes and LDPC block codes (LDPC-BCs) over GF(q). In order to reduce computational complexity and latency, a…

Information Theory · Computer Science 2014-08-13 Kechao Huang , David G. M. Mitchell , Lai Wei , Xiao Ma , Daniel J. Costello

We study Low-Density Parity-Check (LDPC) codes with iterative decoding on block-fading (BF) Relay Channels. We consider two users that employ coded cooperation, a variant of decode-and-forward with a smaller outage probability than the…

Information Theory · Computer Science 2012-10-05 Dieter Duyck , Joseph J. Boutros , Marc Moeneclaey

We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather…

Information Theory · Computer Science 2016-11-18 Joseph J. Boutros , Albert Guillen i Fabregas , Ezio Biglieri , Gilles Zemor

In this work, we analyze efficient window shift schemes for windowed decoding of spatially coupled low-density parity-check (SC-LDPC) codes, which is known to yield close-tooptimal decoding results when compared to full belief propagation…

Information Theory · Computer Science 2018-10-03 Kevin Klaiber , Sebastian Cammerer , Laurent Schmalen , Stephan ten Brink

This paper presents several new construction techniques for low-density parity-check (LDPC) and systematic repeat-accumulate (RA) codes. Based on specific classes of combinatorial designs, the improved code design focuses on high-rate…

Information Theory · Computer Science 2018-07-03 Alexander Gruner , Michael Huber

In this paper, we develop a new decoding algorithm of a binary linear codes for symbol-pair read channels. Symbol-pair read channel has recently been introduced by Cassuto and Blaum to model channels with high write resolution but low read…

Information Theory · Computer Science 2016-12-21 Shunsuke Horii , Toshiyasu Matsushima , Shigeichi Hirasawa

Low precision training and inference affect both the quality and cost of language models, but current scaling laws do not account for this. In this work, we devise "precision-aware" scaling laws for both training and inference. We propose…

For efficient modulation and error control coding, the deliberate flipping approach imposes the run-length-limited(RLL) constraint by bit error before recording. From the read side, a high coding rate limits the correcting capability of RLL…

Information Theory · Computer Science 2023-10-11 Hong-fu Chou

A Bounded-Degree Low-Rank Parity-Check (BD-LRPC) code is a rank-metric code that admits a parity-check matrix whose support is generated by a set of powers of an element. This specific structure of the parity-check matrix was employed to…

Information Theory · Computer Science 2025-09-17 Hermann Tchatchiem Kamche

We show in this work that reinforcement learning can be successfully applied to decoding short to moderate length sparse graph-based channel codes. Specifically, we focus on low-density parity check (LDPC) codes, which for example have been…

Information Theory · Computer Science 2020-10-20 Salman Habib , Allison Beemer , Joerg Kliewer

Accurate modeling of the correlation between the sources plays a crucial role in the efficiency of distributed source coding (DSC) systems. This correlation is commonly modeled in the binary domain by using a single binary symmetric channel…

Information Theory · Computer Science 2012-11-12 Mojtaba Vaezi , Fabrice Labeau

The paper presents bounds on the achievable rates and the decoding complexity of low-density parity-check (LDPC) codes. It is assumed that the communication of these codes takes place over statistically independent parallel channels where…

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

In this paper, we consider quantum error correction over depolarizing channels with non-binary low-density parity-check codes defined over Galois field of size $2^p$ . The proposed quantum error correcting codes are based on the binary…

Information Theory · Computer Science 2016-11-15 Kenta Kasai , Manabu Hagiwara , Hideki Imai , Kohichi Sakaniwa

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

This paper investigates decoding of binary linear block codes over the binary erasure channel (BEC). Of the current iterative decoding algorithms on this channel, we review the Recovery Algorithm and the Guess Algorithm. We then present a…

Information Theory · Computer Science 2007-07-13 J. Cai , C. Tjhai , M. Tomlinson , M. Ambroze , M. Ahmed

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

Multiple reads of the same Flash memory cell with distinct word-line voltages provide enhanced precision for LDPC decoding. In this paper, the word-line voltages are optimized by maximizing the mutual information (MI) of the quantized…

Information Theory · Computer Science 2014-02-20 Jiadong Wang , Kasra Vakilinia , Tsung-Yi Chen , Thomas Courtade , Guiqiang Dong , Tong Zhang , Hari Shankar , Richard Wesel