English
Related papers

Related papers: Low-Resolution Horizontal and Vertical Layered Mut…

200 papers

This paper considers the achievable rates and decoding complexity of low-density parity-check (LDPC) codes over statistically independent parallel channels. The paper starts with the derivation of bounds on the conditional entropy of the…

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

High-rate quantum error correcting (QEC) codes with moderate overheads in qubit number and control complexity are highly desirable for achieving fault-tolerant quantum computing. Recently, quantum error correction has experienced…

Quantum Physics · Physics 2025-01-31 Laura Pecorari , Sven Jandura , Gavin K. Brennen , Guido Pupillo

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

In this paper, a construction of a pair of "regular" quasi-cyclic LDPC codes as ingredient codes for a quantum error-correcting code is proposed. That is, we find quantum regular LDPC codes with various weight distributions. Furthermore our…

Quantum Physics · Physics 2016-11-18 Manabu Hagiwara , Hideki Imai

Characterizing the decoding failure rate of iteratively decoded Low- and Moderate-Density Parity Check (LDPC/MDPC) codes is paramount to build cryptosystems based on them, able to achieve indistinguishability under adaptive chosen…

Cryptography and Security · Computer Science 2019-12-12 Paolo Santini , Alessandro Barenghi , Gerardo Pelosi , Marco Baldi , Franco Chiaraluce

Product codes (PCs) protect a two-dimensional array of bits using short component codes. Assuming transmission over the binary symmetric channel, the decoding is commonly performed by iteratively applying bounded-distance decoding to the…

Information Theory · Computer Science 2017-11-22 Christian Häger , Henry D. Pfister

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

This paper investigates an efficient and practical information reconciliation method in the case where two parties have access to correlated continuous random variables. We show that reconciliation is a special case of channel coding and…

Information Theory · Computer Science 2007-07-13 Matthieu Bloch , Andrew Thangaraj , Steven W. McLaughlin

This paper presents a partially parallel low-density parity-check (LDPC) decoder designed for the 5G New Radio (NR) standard. The design is using a multi-block parallel architecture with a flooding schedule. The decoder can support any code…

Signal Processing · Electrical Eng. & Systems 2021-03-12 Sina Pourjabar , Gwan S. Choi

We develop a new approach for asymmetric LDPC-based information reconciliation in order to adapt to the current channel state and achieve better performance and scalability in practical resource-constrained QKD systems. The new scheme…

Quantum Physics · Physics 2023-02-13 Nikolay Borisov , Ivan Petrov , Andrey Tayduganov

We propose a new type of short to moderate block-length, linear error-correcting codes, called moderate-density parity-check (MDPC) codes. The number of ones of the parity-check matrix of the codes presented is typically higher than the…

Information Theory · Computer Science 2009-11-18 Samuel Ouzan , Yair Be'ery

In fact, the broadcast nature of every transmitter makes it possible for other transceivers in the channel to overhear the broadcasted signal. The proposed idea in cooperative communication is to use these intermediate transceivers as relay…

Signal Processing · Electrical Eng. & Systems 2024-09-25 Ali Mehrban

To alleviate the suboptimal performance of belief propagation (BP) decoding of short low-density parity-check (LDPC) codes, a plethora of improved decoding algorithms has been proposed over the last two decades. Many of these methods can be…

Information Theory · Computer Science 2024-11-01 Felix Krieg , Jannis Clausius , Marvin Geiselhart , Stephan ten Brink

A low-complexity soft-decision concatenated FEC scheme, consisting of an inner LDPC code and an outer staircase code is proposed. The inner code is tasked with reducing the bit error probability below the outer-code threshold. The…

Information Theory · Computer Science 2018-09-25 Masoud Barakatain , Frank R. Kschischang

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

Cyclic liftings are proposed to lower the error floor of low-density parity-check (LDPC) codes. The liftings are designed to eliminate dominant trapping sets of the base code by removing the short cycles which form the trapping sets. We…

Information Theory · Computer Science 2010-02-24 Reza Asvadi , Amir H. Banihashemi , Mahmoud Ahmadian-Attari

In this paper, we propose a class of finite alphabet iterative decoder (FAID), called mutual information-maximizing quantized belief propagation (MIM-QBP) decoder, for decoding regular low-density parity-check (LDPC) codes. Our decoder…

Information Theory · Computer Science 2022-12-19 Xuan He , Kui Cai , Zhen Mei , Peng Kang , Xiaohu Tang

Continuous-variable quantum key distribution utilizes an ensemble of coherent states of light to distribute secret encryption keys between two parties. One of the challenges is thereby the requirement of capacity approaching error…

Information Theory · Computer Science 2021-06-30 Hossein Mani , Tobias Gehring , Christoph Pacher , Ulrik Lund Andersen

The recent development of deep learning methods provides a new approach to optimize the belief propagation (BP) decoding of linear codes. However, the limitation of existing works is that the scale of neural networks increases rapidly with…

Information Theory · Computer Science 2021-02-11 Jincheng Dai , Kailin Tan , Zhongwei Si , Kai Niu , Mingzhe Chen , H. Vincent Poor , Shuguang Cui

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