English
Related papers

Related papers: Sparse Regression LDPC Codes for the Block-Fading …

200 papers

Low density lattice codes (LDLC) are novel lattice codes that can be decoded efficiently and approach the capacity of the additive white Gaussian noise (AWGN) channel. In LDLC a codeword x is generated directly at the n-dimensional…

Information Theory · Computer Science 2007-07-13 Naftali Sommer , Meir Feder , Ofir Shalvi

Ultra-reliable low latency communication (URLLC) is a key part of 5G wireless systems. Achieving low latency necessitates codes with short blocklengths for which polar codes with successive cancellation list (SCL) decoding typically…

Hardware Architecture · Computer Science 2025-12-22 Darja Nonaca , Jérémy Guichemerre , Reinhard Wiesmayr , Nihat Engin Tunali , Christoph Studer

This paper presents a new class of sparse superposition codes for low-rates and short-packet communications over the additive white Gaussian noise channel. The new code is orthogonal sparse superposition (OSS) code. A codeword of OSS codes…

Information Theory · Computer Science 2020-11-24 Yunseo Nam , Jeonghun Park , Songnam Hong , Namyoon Lee

In this paper, we investigate novel strategies for generating rate-compatible (RC) irregular low-density parity-check (LDPC) codes with short/moderate block lengths. We propose three puncturing and two extension schemes, which are designed…

Information Theory · Computer Science 2014-07-22 J. Liu , R. C. de Lamare

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

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

Next-generation channel coding has stringent demands on throughput, energy consumption, and error rate performance while maintaining key features of 5G New Radio (NR) standard codes such as rate compatibility, which is a significant…

Information Theory · Computer Science 2025-05-29 Yuqing Ren , Leyu Zhang , Yifei Shen , Wenqing Song , Emmanuel Boutillon , Alexios Balatsoukas-Stimming , Andreas Burg

Ultra-reliable low-latency vehicular communications (URLLC) require sufficient physical-layer (PHY) compute headroom at the network edge, where roadside units (RSUs) and compact next-generation base stations (gNBs) must meet strict timing…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-10 Ryan Barker , Julia Boone , Tolunay Seyfi , Alireza Ebrahimi Dorcheh , Fatemeh Afghah , Joseph Boccuzzi

Low-density parity-check (LDPC) codes have been successfully commercialized in communication systems due to their strong error correction capabilities and simple decoding process. However, the error-floor phenomenon of LDPC codes, in which…

Information Theory · Computer Science 2023-10-31 Hee-Youl Kwak , Dae-Young Yun , Yongjune Kim , Sang-Hyo Kim , Jong-Seon No

In this chapter, we show how the use of differential coding and the presence of phase slips in the transmission channel affect the total achievable information rates and capacity of a system. By means of the commonly used QPSK modulation,…

Information Theory · Computer Science 2017-04-18 Laurent Schmalen , Stephan ten Brink , Andreas Leven

Quantum error correction (QEC) is a cornerstone of quantum computing, enabling reliable information processing in the presence of noise. Sparse stabilizer codes -- referred to generally as quantum low-density parity-check (QLDPC) codes --…

Quantum Physics · Physics 2025-10-20 Bane Vasic , Valentin Savin , Michele Pacenti , Shantom Borah , Nithin Raveendran

Linear nested codes, where two or more sub-codes are nested in a global code, have been proposed as candidates for reliable multi-terminal communication. In this paper, we consider nested array-based spatially coupled low-density…

Information Theory · Computer Science 2021-02-23 Salman Habib , David G. M. Mitchell , Joerg Kliewer

Non-binary low-density parity-check codes are robust to various channel impairments. However, based on the existing decoding algorithms, the decoder implementations are expensive because of their excessive computational complexity and…

Information Theory · Computer Science 2016-11-18 Chung-Li Wang , Xiaoheng Chen , Zongwang Li , Shaohua Yang

We face the following dilemma for designing low-density parity-check codes (LDPC) for quantum error correction. 1) The row weights of parity-check should be large: The minimum distances are bounded above by the minimum row weights of…

Information Theory · Computer Science 2011-02-16 Manabu Hagiwara , Kenta Kasai , Hideki Imai , Kohichi Sakaniwa

The protograph low-density parity-check (LDPC) codes possess many attractive properties, such as the low encoding/decoding complexity and better error floor performance, and hence have been successfully applied to different types of…

Information Theory · Computer Science 2019-05-01 Xingwei Zhong , Kui Cai , Pingping Chen , Zhen Mei

With the use of belief propagation (BP) decoding algorithm, low-density parity-check (LDPC) codes can achieve near-Shannon limit performance. In order to evaluate the error performance of LDPC codes, simulators running on CPUs are commonly…

Information Theory · Computer Science 2012-07-30 Yue Zhao , Francis C. M. Lau

Algorithms are presented that efficiently shape the parity bits of systematic irregular repeat-accumulate (IRA) low-density parity-check (LDPC) codes by following the sequential encoding order of the accumulator. Simulations over additive…

Information Theory · Computer Science 2025-08-28 Diego Lentner , Thomas Wiegart , Richard D. Wesel

Several types of AL-FEC (Application-Level FEC) codes for the Packet Erasure Channel exist. Random Linear Codes (RLC), where redundancy packets consist of random linear combinations of source packets over a certain finite field, are a…

Information Theory · Computer Science 2014-08-26 Kazuhisa Matsuzono , Vincent Roca , Hitoshi Asaeda

We investigate the construction of quantum low-density parity-check (LDPC) codes from classical quasi-cyclic (QC) LDPC codes with girth greater than or equal to 6. We have shown that the classical codes in the generalized…

Quantum Physics · Physics 2010-02-11 Min-Hsiu Hsieh , Todd A. Brun , Igor Devetak

Unsourced random-access (U-RA) is a type of grant-free random access with a virtually unlimited number of users, of which only a certain number $K_a$ are active on the same time slot. Users employ exactly the same codebook, and the task of…

Information Theory · Computer Science 2021-01-11 Alexander Fengler , Peter Jung , Giuseppe Caire