Belief propagation decoding of quantum LDPC codes with guided decimation
Quantum low-density parity-check (QLDPC) codes have emerged as a promising technique
for quantum error correction. A variety of decoders have been proposed for QLDPC codes …
for quantum error correction. A variety of decoders have been proposed for QLDPC codes …
Threshold saturation for spatially coupled LDPC and LDGM codes on BMS channels
Spatially-coupled low-density parity-check (LDPC) codes, which were first introduced as
LDPC convolutional codes, have been shown to exhibit excellent performance under low …
LDPC convolutional codes, have been shown to exhibit excellent performance under low …
A simple proof of Maxwell saturation for coupled scalar recursions
A Yedla, YY Jian, PS Nguyen… - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
Low-density parity-check (LDPC) convolutional codes (or spatially coupled codes) were
recently shown to approach capacity on the binary erasure channel (BEC) and binary-input …
recently shown to approach capacity on the binary erasure channel (BEC) and binary-input …
Concatenated spatially coupled LDPC codes with sliding window decoding for joint source-channel coding
In this paper, a method for joint source-channel coding (JSCC) based on concatenated
spatially coupled low-density parity-check (SC-LDPC) codes is investigated. A construction …
spatially coupled low-density parity-check (SC-LDPC) codes is investigated. A construction …
Sparse regression codes
R Venkataramanan, S Tatikonda… - … and Trends® in …, 2019 - nowpublishers.com
Develo** computationally-efficient codes that approach the Shannon-theoretic limits for
communication and compression has long been one of the major goals of information and …
communication and compression has long been one of the major goals of information and …
How to achieve the capacity of asymmetric channels
We survey coding techniques that enable reliable transmission at rates that approach the
capacity of an arbitrary discrete memoryless channel. In particular, we take the point of view …
capacity of an arbitrary discrete memoryless channel. In particular, we take the point of view …
Learned decimation for neural belief propagation decoders
We introduce a two-stage decimation process to improve the performance of neural belief
propagation (NBP), recently introduced by Nachmani et al., for short low-density parity-check …
propagation (NBP), recently introduced by Nachmani et al., for short low-density parity-check …
How to achieve the capacity of asymmetric channels
We describe coding techniques that achieve the capacity of a discrete memoryless
asymmetric channel. To do so, we discuss how recent advances in coding for symmetric …
asymmetric channel. To do so, we discuss how recent advances in coding for symmetric …
A Lego-brick approach to coding for network communication
Coding schemes for several problems in network information theory are constructed starting
from point-to-point channel codes that are designed for symmetric channels. Given that the …
from point-to-point channel codes that are designed for symmetric channels. Given that the …
Recursive block Markov superposition transmission of short codes: Construction, analysis, and applications
Extensive studies have demonstrated the effectiveness and the flexibility of constructing
capacity-approaching codes by block Markov superposition transmission (BMST). However …
capacity-approaching codes by block Markov superposition transmission (BMST). However …