QC-LDPC Codes from Difference Matrices and Difference Covering Arrays

by   Diane Donovan, et al.

We give a framework for generalizing LDPC code constructions that use Transversal Designs or related structures such as mutually orthogonal Latin squares. Our construction offers a broader range of code lengths and codes rates. Similar earlier constructions rely on the existence of finite fields of order a power of a prime. In contrast the LDPC codes constructed here are based on difference matrices and difference covering arrays, structures available for any order a. They satisfy the RC constraint and have, for a odd, length a^2 and rate 1-4a-3/a^2, and for a even, length a^2-a and rate at least 1-4a-6/a^2-a. When 3 does not divide a, these LDPC codes have stopping distance at least 8. When a is odd and both 3 and 5 do not divide a, our construction delivers an infinite family of QC-LDPC codes with minimum distance at least 10. The simplicity of the construction allows us to theoretically verify these properties and analytically determine lower bounds for the minimum distance and stopping distance of the code. The BER and FER performance of our codes over AWGN (via simulation) is at the least equivalent to codes constructed previously, while in some cases significantly outperforming them.


page 1

page 2

page 3

page 4


Construction of quaternary Hermitian LCD codes

We introduce a general construction of many Hermitian LCD [n, k] codes f...

New Constructions of MDS Twisted Reed-Solomon Codes and LCD MDS Codes

Maximum distance separable (MDS) codes are optimal where the minimum dis...

A construction of UD k-ary multi-user codes from (2^m(k-1)+1)-ary codes for MAAC

In this paper, we proposed a construction of a UD k-ary T-user coding sc...

A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble

We present an explicit construction of a sequence of rate 1/2 Wozencraft...

Upper bounds on the length function for covering codes

The length function ℓ_q(r,R) is the smallest length of a q-ary linear co...

Improved Singleton bound on insertion-deletion codes and optimal constructions

Insertion-deletion codes (insdel codes for short) play an important role...

Optimal N-ary ECOC Matrices for Ensemble Classification

A new recursive construction of N-ary error-correcting output code (ECOC...

Please sign up or login with your details

Forgot password? Click here to reset