Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth
type: Item
instance of: scholarly article
title: Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth
zbMATH Open document ID: 1241.94034
author: PinYi Ren
author: Qiang Yuan
author: Rui Wang
author: Jun Cai
publication date: 2011-06-17T00:00:00Z
full work available at URL: s11432-010-4152-0
Mathematics Subject Classification ID: 94B15
zbMATH DE Number: 5909065
zbMATH Keywords: quasi-cyclic codes
zbMATH Keywords: LDPC codes
zbMATH Keywords: low-density parity-check codes
zbMATH Keywords: circulant permutation matrix
zbMATH Keywords: girth
describes a project that uses: LDPC
MaRDI profile type: Publication
OpenAlex ID: W2000494984
cites work: Q5538637
cites work: Expander codes
cites work: Good error-correcting codes based on very sparse matrices
cites work: The capacity of low-density parity-check codes under message-passing decoding
cites work: Low-density parity-check codes based on finite geometries: a rediscovery and new results
cites work: Construction of Irregular LDPC Codes by Quasi-Cyclic Extension
cites work: Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than $12$
cites work: Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
cites work: A recursive approach to low complexity codes
cites work: Regular and irregular progressive edge-growth tanner graphs
DOI: 10.1007/S11432-010-4152-0
published in: Science China Information Sciences
description: scientific article; zbMATH DE number 5909065