DeepAI AI Chat
Log In Sign Up

Analysis of Low-Density Parity-Check Codes over Finite Integer Rings for the Lee Channel

by   Jessica Bariffi, et al.

We study the performance of low-density parity-check (LDPC) codes over finite integer rings, over two channels that arise from the Lee metric. The first channel is a discrete memory-less channel (DMC) matched to the Lee metric. The second channel adds to each codeword an error vector of constant Lee weight, where the error vector is picked uniformly at random from the set of vectors of constant Lee weight. It is shown that the marginal conditional distribution of the two channels coincides, in the limit of large blocklengths. The performance of selected LDPC code ensembles is analyzed by means of density evolution and finite-length simulations, with belief propagation decoding and with a low-complexity symbol message passing algorithm.


page 1

page 2

page 3

page 4


Symbol Message Passing Decoding of Nonbinary Low-Density Parity-Check Codes

We present a novel decoding algorithm for q-ary low-density parity-check...

On the Properties of Error Patterns in the Constant Lee Weight Channel

The problem of scalar multiplication applied to vectors is considered in...

Design of Capacity-Approaching Low-Density Parity-Check Codes using Recurrent Neural Networks

In this paper, we model Density Evolution (DE) using Recurrent Neural Ne...

Protograph LDPC Code Design for Asynchronous Random Access

This work addresses the physical layer channel code design for an uncoor...

Finite Length Analysis of Irregular Repetition Slotted ALOHA in the Waterfall Region

A finite length analysis is introduced for irregular repetition slotted ...

Increasing Transmission Distance in THz systems with MDPC Code and Auxiliary Channel

We analyze whether multidimensional parity check (MDPC) code and an auxi...

Degree-degree Correlated Low-density Parity-check Codes Over a Binary Erasure Channel

Most existing works on analyzing the performance of a random ensemble of...