English
Related papers

Related papers: Parity Check Codes for Second Order Diversity

200 papers

In this letter, we propose a reliability-based windowed decoding scheme for spatially-coupled (SC) low-density parity-check (LDPC) codes. To mitigate the error propagation along the sliding windowed decoder of the SC LDPC codes, a partial…

Information Theory · Computer Science 2018-05-10 Peng Kang , Yixuan Xie , Lei Yang , Jinhong Yuan

In this paper, we report an encoding and decoding method for irregular-quasic-cyclic low-density parity-check (IR-QC-LDPC) codes with multi rates. The algorithm is applicable to parity-check matrices which have dual-diagonal parity…

Information Theory · Computer Science 2019-10-31 Kun Cheng , Qiming Lu , Hongbo Xie , Qi Shen , Shengkai Liao , Chengzhi Peng

A visible light communication (VLC) system can adopt multi-color light emitting diode (LED) arrays to support multiple users. In this paper, a multi-layer coding and constrained partial group decoding (CPGD) method is proposed to tackle…

Signal Processing · Electrical Eng. & Systems 2018-05-22 Guangtao Zheng , Chen Gong , Zhengyuan Xu

We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code ensemble, the linear programming decoder of Feldman et al. succeeds in…

Information Theory · Computer Science 2016-11-15 Constantinos Daskalakis , Alexandros G. Dimakis , Richard M. Karp , Martin J. Wainwright

Sparse regression codes (SPARCs) are a class of codes that encode information through the superposition of columns of a randomised coding matrix. The combination with an outer non-binary low density parity check (NB-LDPC) code was recently…

Information Theory · Computer Science 2025-09-23 Alexander Fengler , Burak Çakmak , Giuseppe Caire

Polar codes are constructed for m-user multiple access channels (MAC) whose input alphabet size is a prime number. The block error probability under successive cancelation decoding decays exponentially with the square root of the block…

Information Theory · Computer Science 2011-12-09 Rajai Nasser

The paper presents bounds on the achievable rates and the decoding complexity of low-density parity-check (LDPC) codes. It is assumed that the communication of these codes takes place over statistically independent parallel channels where…

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

Fast SC decoding overcomes the latency caused by the serial nature of the SC decoding by identifying new nodes in the upper levels of the SC decoding tree and implementing their fast parallel decoders. In this work, we first present a novel…

This work considers optimizing LDPC codes in the physical-layer network coded two-way relay channel using noncoherent FSK modulation. The error-rate performance of channel decoding at the relay node during the multiple-access phase was…

Information Theory · Computer Science 2015-02-23 Terry Ferrett , Matthew C. Valenti

Coherent parity check (CPC) codes are a new framework for the construction of quantum error correction codes that encode multiple qubits per logical block. CPC codes have a canonical structure involving successive rounds of bit and phase…

Quantum Physics · Physics 2018-06-08 Joschka Roffe , David Headley , Nicholas Chancellor , Dominic Horsman , Viv Kendon

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

Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. LP decoding has been derived for binary and nonbinary linear codes. However, the most…

Information Theory · Computer Science 2016-11-17 Mayur Punekar , Pascal O. Vontobel , Mark F. Flanagan

The recently proposed SCLF decoding algorithm for polar codes improves the error-correcting performance of state-of-the-art SCL decoding. However, it comes at the cost of a higher complexity. In this paper, partitioned polar codes tailored…

Information Theory · Computer Science 2026-05-12 Charles Pillet , Ilshat Sagitov , Pascal Giard

For finite length polar codes, channel polarization leaves a significant number of channels not fully polarized. Adding a Cyclic Redundancy Check (CRC) to better protect information on the semi-polarized channels has already been…

Information Theory · Computer Science 2016-11-14 A. Elkelesh , M. Ebada , S. Cammerer , S. ten Brink

A novel method guaranteeing nondecreasing girth is presented for constructing longer low-density parity-check (LDPC) codes from shorter ones. The parity-check matrix of a shorter base code is decomposed into N (N>=2) non-overlapping…

Information Theory · Computer Science 2018-01-29 Guohua Zhang , Yulin Hu , Qinwei He

In this paper, we propose a decision-aided scheme for parallel SC-List decoding of polar codes. At the parallel SC-List decoder, each survival path is extended based on multiple information bits, therefore the number of split paths becomes…

Information Theory · Computer Science 2015-06-10 Bin Li , Hui Shen , Kai Chen

We analyze the trade-off between the undetected error probability (i.e., the probability that the channel decoder outputs an erroneous message without detecting the error) and the total error probability in the short blocklength regime. We…

Information Theory · Computer Science 2025-03-05 Alexander Sauter , A. Oguz Kislal , Giuseppe Durisi , Gianluigi Liva , Balazs Matuz , Erik G. Ström

The 5th generation wireless systems (5G) standardization process of the 3rd generation partnership project (3GPP) chose polar codes as a channel coding scheme for the control channel. In case of downlink control information, polar codes are…

Information Theory · Computer Science 2020-01-28 Charles Pillet , Valerio Bioglio , Carlo Condo

Variant belief propagation (BP) algorithms are applied to low-density parity-check (LDPC) codes. However, conventional decoders suffer from a large resource consumption due to gathering messages from all the neighbour variable-nodes and/or…

Information Theory · Computer Science 2023-08-24 Wu Guan , Liping Liang

In this paper we study the long-term throughput performance of repetition protocols coupled with power control for multiple access block-fading channels. We propose to use the feedback bits to inform the transmitter about the decoding…

Information Theory · Computer Science 2010-09-24 Davide Barbieri , Daniela Tuninetti