A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices

DOI10.1134/S0032946017030048MaRDI QIDQ1752308zbMATH OpenOpenAlexFDO

Authors Fedor Illarionovich Ivanov

Publication date 24 May 2018

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0032946017030048

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Recommendations

• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
• Low-density parity-check codes based on Steiner systems and permutation matrices
• On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices
• Quasi-Cyclic LDPC Codes for Fast Encoding
• LDPC Block and Convolutional Codes Based on Circulant Matrices

Cites work

• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than $12$
• Regular and irregular progressive edge-growth tanner graphs

Cited in

(4)

• Low-density parity-check codes based on Steiner systems and permutation matrices
• Low density parity check convolutional codes derived from quasi-cyclic block codes
• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
• A matrix-theoretic approach for analyzing quasi-cyclic low-density parity-check codes

Describes a project that uses

Uses Software

• QC-LDPC

This page was built for publication: A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752308)