English
Related papers

Related papers: Polarized Low-Density Parity-Check Codes on the BS…

200 papers

In this paper, we introduce a new practical and general method for solving the main problem of designing the capacity approaching, optimal rate, irregular low-density parity-check (LDPC) code ensemble over binary erasure channel (BEC).…

Information Theory · Computer Science 2016-11-18 H. Tavakoli , M. Ahmadian Attari , M. Reza Peyghami

CRC-Polar codes under SC list decoding are well-regarded for their competitive error performance. This paper examines these codes by focusing on minimum weight codewords, breaking them down into the rows of the polar transform. Inspired by…

Information Theory · Computer Science 2025-02-06 Xinyi Gu , Mohammad Rowshan , Jinhong Yuan

We discuss the performance of Low-Density-Parity-Check (LDPC) codes decoded by means of Linear Programming (LP) at moderate and large Signal-to-Noise-Ratios (SNR). Utilizing a combination of the previously introduced pseudo-codeword-search…

Information Theory · Computer Science 2007-07-13 Michael Chertkov , Mikhail Stepanov

In this paper, we propose a non-uniform windowed decoder for multi-dimensional spatially-coupled LDPC (MD-SC-LDPC) codes over the binary erasure channel. An MD-SC-LDPC code is constructed by connecting together several SC-LDPC codes into…

Information Theory · Computer Science 2020-05-13 Lev Tauz , Homa Esfahanizadeh , Lara Dolecek

In this work, we propose structured Root-Low-Density Parity-Check (LDPC) codes and design techniques for block-fading channels. In particular, Quasi-Cyclic Root-LDPC codes, Irregular repeat-accumulate Root-LDPC codes and Controlled Doping…

Information Theory · Computer Science 2015-12-09 C. T. Healy , A. G. D. Uchoa , R. C. de Lamare

Low-density parity-check (LDPC) convolutional codes are capable of achieving excellent performance with low encoding and decoding complexity. In this paper we discuss several graph-cover-based methods for deriving families of time-invariant…

Information Theory · Computer Science 2015-03-17 Ali E. Pusane , Roxana Smarandache , Pascal O. Vontobel , Daniel J. Costello

Based on the extended binary image of non-binary LDPC codes, we propose a method for generating extra redundant bits, such as to decreases the coding rate of a mother code. The proposed method allows for using the same decoder, regardless…

Information Theory · Computer Science 2011-03-15 Lam Pham Sy , Valentin Savin , David Declercq

Quantum cryptography via key distribution mechanisms that utilize quantum entanglement between sender-receiver pairs will form the basis of future large-scale quantum networks. A key engineering challenge in such networks will be the…

Information Theory · Computer Science 2015-05-14 Yixuan Xie , Jun Li , Robert Malaney , Jinhong Yuan

A protograph-based low-density parity-check (LDPC) code design technique for bandwidth-efficient coded modulation is presented. The approach jointly optimizes the LDPC code node degrees and the mapping of the coded bits to the…

Information Theory · Computer Science 2015-04-15 Fabian Steiner , Georg Böcherer , Gianluigi Liva

A new approach for combining non-binary low-density parity-check (NB-LDPC) codes with higher-order modulation and probabilistic amplitude shaping (PAS) is presented. Instead of symbol-metric decoding (SMD), a bit-metric decoder (BMD) is…

Information Theory · Computer Science 2018-09-12 Fabian Steiner , Georg Böcherer , Gianluigi Liva

In this paper, we propose to study and optimize a very general class of LDPC codes whose variable nodes belong to finite sets with different orders. We named this class of codes Hybrid LDPC codes. Although efficient optimization techniques…

Information Theory · Computer Science 2007-07-16 Lucile Sassatelli , David Declercq

In this paper, we present a construction method of non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an extension of Felstroem and Zigangirov construction for non-binary LDPC convolutional codes. The…

Information Theory · Computer Science 2015-05-20 Hironori Uchikawa , Kenta Kasai , Kohichi Sakaniwa

Accurate modeling of the correlation between the sources plays a crucial role in the efficiency of distributed source coding (DSC) systems. This correlation is commonly modeled in the binary domain by using a single binary symmetric channel…

Information Theory · Computer Science 2012-11-12 Mojtaba Vaezi , Fabrice Labeau

This paper considers the optimization of multi-edge type low-density parity-check (METLDPC) codes to maximize the decoding threshold. We propose an algorithm to jointly optimize the node degree distribution and the multi-edge structure of…

Information Theory · Computer Science 2016-05-17 Sachini Jayasooriya , Mahyar Shirvanimoghaddam , Lawrence Ong , Sarah J. Johnson

The joint design of input constellation and low-density parity-check (LDPC) codes to approach the symmetric capacity of the two-user Gaussian multiple access channel is studied. More specifically, multilevel coding is employed at each user…

Information Theory · Computer Science 2019-05-02 Alexios Balatsoukas-Stimming , Stefano Rini , Joerg Kliewer

The iterative decoding threshold of low-density parity-check (LDPC) codes over the binary erasure channel (BEC) fulfills an upper bound depending only on the variable and check nodes with minimum distance 2. This bound is a consequence of…

Information Theory · Computer Science 2010-07-28 Enrico Paolini , Marc Fossorier , Marco Chiani

This article presents a novel enhancement to the random spreading based coding scheme developed by Pradhan et al.\ for the unsourced multiple access channel. The original coding scheme features a polar outer code in conjunction with a…

Information Theory · Computer Science 2021-05-31 Asit Kumar Pradhan , Vamsi K. Amalladinne , Krishna R. Narayanan , Jean-Francois Chamberland

The Alternating Direction Method of Multipliers (ADMM) decoding of Low Density Parity Check (LDPC) codes has received many attentions due to its excellent performance at the error floor region. In this paper, we develop a parameter-free…

Information Theory · Computer Science 2018-04-25 Qiong Wu , Fan Zhang , Hao Wang , Jun Lin , Yang Liu

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

Generalized low-density parity-check (GLDPC) codes, where single parity-check constraints on the code bits are replaced with generalized constraints (an arbitrary linear code), are a promising class of codes for low-latency communication.…

Information Theory · Computer Science 2025-08-12 Roxana Smarandache , David G. M. Mitchell , Anthony Gómez-Fonseca