English
Related papers

Related papers: LDPC-Coded Molecular Communications with Increased…

200 papers

Recently introduced Fair-Density Parity-Check (FDPC) codes, targeting high-rate applications, offer superior error-correction performance (ECP) compared to 5G Low-Density Parity-Check (LDPC) codes, given the same number of message-passing…

Information Theory · Computer Science 2025-06-16 Mohsen Moradi , Sheida Rabeti , Hessam Mahdavifar

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-01-23 Fabian Steiner , Georg Böcherer , Gianluigi Liva

We analyze the performance of quantized min-sum decoding of low-density parity-check codes under unreliable message storage. To this end, we introduce a simple bit-level error model and show that decoder symmetry is preserved under this…

Information Theory · Computer Science 2014-04-08 Alexios Balatsoukas-Stimming , Andreas Burg

An algorithm is proposed to encode low-density parity-check (LDPC) codes into codewords with a non-uniform distribution. This enables power-efficient signalling for asymmetric channels. We show gains of 0.9 dB for additive white Gaussian…

Information Theory · Computer Science 2023-05-24 Thomas Wiegart , Linfang Wang , Diego Lentner , Richard D. Wesel

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

Recently, a novel lookup table based decoding method for binary low-density parity-check codes has attracted considerable attention. In this approach, mutual-information maximizing lookup tables replace the conventional operations of the…

Information Theory · Computer Science 2019-10-24 Maximilian Stark , Jan Lewandowsky , Souradip Saha , Gerhard Bauch

Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. The aim of LP decoding is to develop an algorithm which has error-correcting performance…

Information Theory · Computer Science 2010-10-05 Mayur Punekar , Mark F. Flanagan

While linear programming (LP) decoding provides more flexibility for finite-length performance analysis than iterative message-passing (IMP) decoding, it is computationally more complex to implement in its original form, due to both the…

Information Theory · Computer Science 2009-02-05 Mohammad H. Taghavi , Amin Shokrollahi , Paul H. Siegel

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

The error floor of LDPC is revisited as an effect of dynamic message behavior in the so-called absorption sets of the code. It is shown that if the signal growth in the absorption sets is properly balanced by the growth of set-external…

Information Theory · Computer Science 2012-10-10 Shuai Zhang , Christian Schlegel

Novel sparse regression LDPC (SR-LDPC) codes exhibit excellent performance over additive white Gaussian noise (AWGN) channels in part due to their natural provision of shaping gains. Though SR-LDPC-like codes have been considered within the…

Information Theory · Computer Science 2024-02-13 Jamison R. Ebert , Jean-Francois Chamberland , Krishna R. Narayanan

We enhance coarsely quantized LDPC decoding by reusing computed check node messages from previous iterations. Typically, variable and check nodes update and replace old messages every iteration. We show that, under coarse quantization,…

Information Theory · Computer Science 2025-01-22 Philipp Mohr , Gerhard Bauch

In this paper, we propose an efficient decoding algorithm for short low-density parity check (LDPC) codes by carefully combining the belief propagation (BP) decoding and order statistic decoding (OSD) algorithms. Specifically, a modified BP…

Information Theory · Computer Science 2023-09-06 Weiyang Zhang , Chentao Yue , Yonghui Li , Branka Vucetic

Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an ideal maximum-distance-separable code on the binary erasure…

Information Theory · Computer Science 2008-04-21 Enrico Paolini , Gianluigi Liva , Michela Varrella , Balazs Matuz , Marco Chiani

This paper proposes a method for designing error correction codes by combining a known coding scheme with an autoencoder. Specifically, we integrate an LDPC code with a trained autoencoder to develop an error correction code for intractable…

Information Theory · Computer Science 2020-03-03 Eren Balevi , Jeffrey G. Andrews

Molecular communication suffers from severe inter-symbol interference, which makes constrained coding essential for reliable transmission. Run-length-limited ISI-mitigation codes are attractive because they select low-weight constrained…

Information Theory · Computer Science 2026-05-01 Melih Şahin , Ozgur B. Akan

Recently, low-resolution LDPC decoders have been introduced that perform mutual information maximizing signal processing. However, the optimal quantization in variable and check nodes requires expensive non-uniform operations. Instead, we…

Information Theory · Computer Science 2022-11-15 Philipp Mohr , Gerhard Bauch

We present the Low Density Parity Check (LDPC) forward error correction algorithm adapted for the Quantum Key Distribution (QKD) protocol in a form readily applied by developers. A sparse parity check matrix is required for the LDPC…

Cryptography and Security · Computer Science 2014-04-03 Alan Mink , Anastase Nakassis

We investigate the reasons behind the superior performance of belief propagation decoding of non-binary LDPC codes over their binary images when the transmission occurs over the binary erasure channel. We show that although decoding over…

Information Theory · Computer Science 2016-11-15 Aman Bhatia , Aravind R. Iyengar , Paul H. Siegel

We derive bounds on the asymptotic density of parity-check matrices and the achievable rates of binary linear block codes transmitted over memoryless binary-input output-symmetric (MBIOS) channels. The lower bounds on the density of…

Information Theory · Computer Science 2007-07-13 Gil Wiechman , Igal Sason
‹ Prev 1 3 4 5 6 7 10 Next ›