Capacity-achieving Polar-based LDGM Codes

12/27/2020
by   James Chin-Jen Pang, et al.
0

In this paper, we study codes with sparse generator matrices. More specifically, low-density generator matrix (LDGM) codes with a certain constraint on the weight of all the columns in the generator matrix are considered. In this paper, it is first shown that when a binary-input memoryless symmetric (BMS) channel W and a constant s>0 are given, there exists a polarization kernel such that the corresponding polar code is capacity-achieving and the column weights of the generator matrices are bounded from above by N^s. Then, a general construction based on a concatenation of polar codes and a rate-1 code, and a new column-splitting algorithm that guarantees a much sparser generator matrix is given. More specifically, for any BMS channel and any ϵ > 2ϵ^*, where ϵ^* ≈ 0.085, an existence of sequence of capacity-achieving codes with all the column wights of the generator matrix upper bounded by (log N)^1+ϵ is shown. Furthermore, coding schemes for BEC and BMS channels, based on a second column-splitting algorithm are devised with low-complexity decoding that uses successive-cancellation. The second splitting algorithm allows for the use of a low-complexity decoder by preserving the reliability of the bit-channels observed by the source bits, and by increasing the code block length. In particular, for any BEC and any λ >λ^* = 0.5+ϵ^*, the existence of a sequence of capacity-achieving codes where all the column wights of the generator matrix are bounded from above by (log N)^2λ and with decoding complexity O(Nloglog N) is shown. The existence of similar capacity-achieving LDGM codes with low-complexity decoding is shown for any BMS channel, and for any λ >λ^†≈ 0.631.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/16/2023

Capacity-achieving Polar-based Codes with Sparsity Constraints on the Generator Matrices

In this paper, we leverage polar codes and the well-established channel ...
research
01/31/2020

Capacity-achieving Polar-based LDGM Codes with Crowdsourcing Applications

In this paper we study codes with sparse generator matrices. More specif...
research
08/19/2022

Two dimensional RC/Subarray Constrained Codes: Bounded Weight and Almost Balanced Weight

In this work, we study two types of constraints on two-dimensional binar...
research
01/04/2019

Practical Polar Code Construction Using Generalised Generator Matrices

Polar coding is a recently proposed coding technique that can provably a...
research
02/06/2019

Asymmetric Construction of Low-Latency and Length-Flexible Polar Codes

Polar codes are a class of capacity-achieving error correcting codes tha...
research
02/08/2018

General Strong Polarization

Arı kan's exciting discovery of polar codes has provided an altogether n...
research
03/13/2023

Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures

In this paper, we study upper bounds on the minimum length of frameproof...

Please sign up or login with your details

Forgot password? Click here to reset