ScholarLens Back to search
2011•Unpublished venueRequires access

A class of (3, k) quasi-cyclic LDPC codes from difference sequences with girth 8

Bing Li, Lijun Zhang, L. L. Cheng

Open publisher page 3 citations

Abstract

An approach for constructing a class of (3, k)-regular quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed, which is based on combinatorial objects termed difference sequences. By an efficient algorithm for searching good difference sequences, codes in this class have girth at least eight. Simulation results show that the codes slightly outperform the counterpart PEG codes and have better performance than the corresponding MacKay codes and array codes.

About this research paper

What this paper is about

An approach for constructing a class of (3, k)-regular quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed, which is based on combinatorial objects termed difference sequences. By an efficient algorithm for searching good difference sequences, codes in this class have girth at least eight. Simulation results show that the codes slightly outperform the counterpart PEG codes and have better performance than the corresponding MacKay codes and array codes.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

An approach for constructing a class of (3, k)-regular quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed, which is based on combinatorial objects termed difference sequences. By an efficient algorithm for searching good difference sequences, codes in this class have girth at least eight. Simulation results show that the codes slightly outperform the counterpart PEG codes and have better performance than the corresponding MacKay codes and array codes.

Key concepts: Low-density parity-check code, Girth (graph theory), Mathematics, Class (philosophy), Combinatorics, Discrete mathematics, Tanner graph, Concatenated error correction code

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A class of (3, k) quasi-cyclic LDPC codes from difference sequences with girth 8 — Research Paper | ScholarLens