2016•Wireless Personal CommunicationsRequires access

A New Construction Method for Large Girth Quasi-Cyclic LDPC Codes with Optimized Lower Bound using Chinese Remainder Theorem

Ambar Bajpai, Gan Srirutchataboon, Piya Kovintavewat, Lunchakorn Wuttisittikulkij

Open publisher page 9 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 9 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.

Key concepts: Low-density parity-check code, Circulant matrix, Girth (graph theory), Chinese remainder theorem, Parity-check matrix, Permutation matrix, Computer science, Mathematics

Back to paper search Browse research topics Original source

A New Construction Method for Large Girth Quasi-Cyclic LDPC Codes with Optimized Lower Bound using Chinese Remainder Theorem — Research Paper | ScholarLens