English
Related papers

Related papers: Outage-Limit-Approaching Protograph LDPC Codes for…

200 papers

Quantum low-density parity-check codes are promising candidates towards scalable fault-tolerant quantum computation. Among these, bivariate bicycle (BB) codes offer superior encoding rates and large code distance compared to surface codes.…

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 design of self-connected spatially coupled low-density parity-check (SC-LDPC) codes. First, a termination method is proposed to reduce rate loss. Particularly, a single-side open SC-LDPC ensemble is introduced,…

Information Theory · Computer Science 2023-07-03 Yihuan Liao , Min Qiu , Jinhong Yuan

As the mobile application landscape expands, wireless networks are tasked with supporting various connection profiles, including real-time communications and delay-sensitive traffic. Among many ensuing engineering challenges is the need to…

Information Theory · Computer Science 2012-02-13 Fatemeh Hamidi-Sepehr , Jean-Francois Chamberland , Henry Pfister

This paper describes the design and C99 implementation of a free and open-source Low-Density Parity-Check (LDPC) codes encoder and decoder focused primarily on the Quasi-Cyclic LDPC (QCLDPC) codes utilized in the IEEE 802.11ax-2021 (Wi-Fi…

Information Theory · Computer Science 2023-06-22 Tomas Palenik , Viktor Szitkey

We study the design of spectrally efficient fiber-optical communication systems based on different spatially coupled (SC) forward error correction (FEC) schemes. In particular, we optimize the allocation of the coded bits from the FEC…

Information Theory · Computer Science 2024-01-30 Christian Häger , Alexandre Graell i Amat , Fredrik Brännström , Alex Alvarado , Erik Agrell

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 2017-01-27 Laurent Schmalen , Vahid Aref , Fanny Jardel

Protograph-based, off-the-shelf low-density parity-check (LDPC) codes are optimized for higher-order modulation and quantized sum-product decoders. As an example, for the recently proposed LDPC code from the upcoming IEEE 802.3ca standard…

Information Theory · Computer Science 2018-10-02 Fabian Steiner , Gerhard Kramer

This work considers the design of short non-binary low-density parity-check (LDPC) codes over finite fields of order m, for channels with phase noise. In particular, m-ary differential phase-shift keying (DPSK) modulated code symbols are…

Information Theory · Computer Science 2019-08-09 Tudor Ninacs , Balázs Matuz , Gianluigi Liva , Giulio Colavolpe

Low-capacity scenarios have become increasingly important in the technology of the Internet of Things (IoT) and the next generation of wireless networks. Such scenarios require efficient and reliable transmission over channels with an…

Information Theory · Computer Science 2023-02-07 Mohammad Fereydounian , Hamed Hassani , Mohammad Vahid Jamali , Hessam Mahdavifar

The linear error-correcting codes are known to be well suited for battling and correcting the burst errors caused by noise in the wireless data transmission system. However, different types of codes offer different decoding and…

Signal Processing · Electrical Eng. & Systems 2019-09-24 Nima Taherkhani , Merve Apalak , Kamran Kiasaleh

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

Spatially-Coupled (SC)-LDPC codes are known to have outstanding error-correction performance and low decoding latency. Whereas previous works on LDPC and SC-LDPC codes mostly take either an asymptotic or a finite-length design approach, in…

Information Theory · Computer Science 2022-09-02 Homa Esfahanizadeh , Eshed Ram , Yuval Cassuto , Lara Dolecek

Spatially coupled low-density parity-check codes show an outstanding performance under the low-complexity belief propagation (BP) decoding algorithm. They exhibit a peculiar convergence phenomenon above the BP threshold of the underlying…

Information Theory · Computer Science 2013-07-16 Vahid Aref , Laurent Schmalen , Stephan ten Brink

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

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

Batched network codes (BNCs) are a low-complexity solution for communication through networks with packet loss. Although their belief propagation (BP) performance is proved to approach capacity in the asymptotic regime, there is no evidence…

Information Theory · Computer Science 2025-03-05 Mingyang Zhu , Ming Jiang , Chunming Zhao

Quantum low-density parity-check (qLDPC) codes are a promising construction for drastically reducing the overhead of fault-tolerant quantum computing (FTQC) architectures. However, all of the known hardware implementations of these codes…

Quantum error correction (QEC) is critical for practical realization of fault-tolerant quantum computing, and recently proposed families of quantum low-density parity-check (QLDPC) code are prime candidates for advanced QEC hardware…

Information Theory · Computer Science 2025-03-11 Nithin Raveendran , David Declercq , Bane Vasić

In this paper, we analyze the finite-length performance of codes on graphs constructed by connecting spatially coupled low-density parity-check (SC-LDPC) code chains. Successive (peeling) decoding is considered for the binary erasure…

Information Theory · Computer Science 2014-03-03 Pablo M. Olmos , David G. M. Mitchell , Dmitri Truhachev , Daniel J. Costello
‹ Prev 1 4 5 6 7 8 10 Next ›