English
Related papers

Related papers: Performance Comparison of LDPC Block and Spatially…

200 papers

The decoding throughput in the postprocessing is one of the bottlenecks for a continuous-variable quantum key distribution (CV-QKD) system. In this paper, we propose a layered decoder to decode quasi-cyclic multi-edge type LDPC (QC-METLDPC)…

Quantum Physics · Physics 2020-04-21 Yang Li , Xiaofang Zhang , Yong Li , Bingjie Xu , Li Ma , Jie Yang , Wei Huang

We present a general approach to designing capacity-approaching high-girth low-density parity-check (LDPC) codes that are friendly to hardware implementation. Our methodology starts by defining a new class of "hierarchical" quasi-cyclic…

Information Theory · Computer Science 2016-11-17 Yige Wang , Stark C. Draper , Jonathan S. Yedidia

A method for estimating the performance of low-density parity-check (LDPC) codes decoded by hard-decision iterative decoding algorithms on binary symmetric channels (BSC) is proposed. Based on the enumeration of the smallest weight error…

Information Theory · Computer Science 2007-07-13 Hua Xiao , Amir H. Banihashemi

The complexity-performance trade-off is a fundamental aspect of the design of low-density parity-check (LDPC) codes. In this paper, we consider LDPC codes for the binary erasure channel (BEC), use code rate for performance metric, and…

Information Theory · Computer Science 2016-11-17 Vahid Jamali , Yasser Karimian , Johannes Huber , Mahmoud Ahmadian

We study LDPC codes for the channel with input ${x}\in \mathbb{F}_q^m$ and output ${y}={x}+{z}\in \mathbb{F}_q^m$. The aim of this paper is to evaluate decoding performance of $q^m$-ary non-binary LDPC codes for large $m$. We give density…

Information Theory · Computer Science 2014-01-29 Koji Tazoe , Kenta Kasai , Kohichi Sakaniwa

In this paper, we study a compute-and-forward (CAF) relaying scheme with low-density parity-check (LDPC) codes, a special case of physical layer network coding, under the quadrature phase shift keying (QPSK) modulation. The novelty of this…

Information Theory · Computer Science 2019-04-18 Satoshi Takabe , Tadashi Wadayama , Ángeles Vazquez-Castro , Masahito Hayashi

A major challenge in fault-tolerant quantum computation (FTQC) is to reduce both space overhead -- the large number of physical qubits per logical qubit -- and time overhead -- the long physical gate sequences per logical gate. We prove…

Quantum Physics · Physics 2024-12-06 Shiro Tamiya , Masato Koashi , Hayata Yamasaki

Quantum low-density parity check (qLDPC) codes offer higher encoding rate than topological codes, e.g. surface codes, making them favourable for practical, fault-tolerant quantum computing with low overhead. These codes are particularly…

Quantum Physics · Physics 2025-09-23 Susan X. Chen , Matthias C. Löbl , Ming Lai Chan , Anders S. Sørensen , Stefano Paesani

This paper basically expresses the core fundamentals and brief overview of the research of R. G. GALLAGER [1] on Low-Density Parity-Check (LDPC) codes and various parameters related to LDPC codes like, encoding and decoding of LDPC codes,…

Information Theory · Computer Science 2020-09-21 Saumya Borwankar , Dhruv Shah

We propose a novel encoding/transmission scheme called continuous chain (CC) transmission that is able to improve the finite-length performance of a system using spatially-coupled low-density parity-check (SC-LDPC) codes. In CC…

Information Theory · Computer Science 2019-10-04 Pablo M. Olmos , David G. M. Mitchell , Dmitri Truhachev , Daniel J. Costello

We investigate random spatially coupled low-density parity-check (SC-LDPC) code ensembles over finite fields. Under different variable-node edge-spreading rules, the random Tanner graphs of several coupled ensembles are defined by multiple…

Information Theory · Computer Science 2026-01-01 Jiaxin Lyu , Guanghui He

This paper propose a decoder architecture for low-density parity-check convolutional code (LDPCCC). Specifically, the LDPCCC is derived from a quasi-cyclic (QC) LDPC block code. By making use of the quasi-cyclic structure, the proposed…

Information Theory · Computer Science 2016-11-17 Chiu-Wing Sham , Xu Chen , Francis C. M. Lau , Yue Zhao , Wai M. Tam

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

Spatially coupled serially concatenated codes (SC-SCCs) are a class of spatially coupled turbo-like codes, which have a close-to-capacity performance and low error floor. In this paper we investigate the impact of coupling memory, block…

Information Theory · Computer Science 2021-07-27 Mojtaba Mahdavi , Muhammad Umar Farooq , Liang Liu , Ove Edfors , Viktor Öwall , Michael Lentmaier

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

Fault tolerance in quantum protocols requires contributions from error-correcting codes and their suitable decoders. Quantum Low-Density Parity Check (QLDPC) codes are one of the most explored quantum codes that have good coding rate and…

Quantum Physics · Physics 2026-04-24 Mainak Bhattacharyya , Ankur Raina

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

The error correction performance of low-density parity-check (LDPC) codes under iterative message-passing decoding is degraded by the presence of certain harmful objects existing in their Tanner graph representation. Depending on the…

Information Theory · Computer Science 2019-04-16 Massimo Battaglioni , Franco Chiaraluce , Marco Baldi , David Mitchell

This paper studies coding schemes for the $q$-ary symmetric channel based on binary low-density parity-check (LDPC) codes that work for any alphabet size $q=2^m$, $m\in\mathbb{N}$, thus complementing some recently proposed packet-based…

Information Theory · Computer Science 2015-03-13 Claudio Weidmann , Gottfried Lechner

We study the performance of binary spatially-coupled low-density parity-check codes (SC-LDPC) when used with bit-interleaved coded-modulation (BICM) schemes. This paper considers the cases when transmission takes place over additive white…

Information Theory · Computer Science 2013-03-05 Arvind Yedla , Mostafa El-Khamy , Jungwon Lee , Inyup Kang