Upper bound on the minimum distance of LDPC codes over GF(q) based on counting the number of syndromes

DOI10.1134/S0032946016010026MaRDI QIDQ522923zbMATH OpenOpenAlexFDO

Authors Alexey Frolov

Publication date 19 April 2017

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Upper bounds on the rate of LDPC codes as a function of minimum distance
• Upper bounds on the rate of LDPC codes
• Minimum distance and pseudodistance lower bounds for generalised LDPC codes
• Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
• Distance Bounds for an Ensemble of LDPC Convolutional Codes

Cites work

• A new upper bound on nonbinary block codes
• A recursive approach to low complexity codes
• Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
• scientific article; zbMATH DE number 3410920 (Why is no real title available?)
• Upper bounds on the rate of LDPC codes as a function of minimum distance

Cited in

(2)

• Upper bounds on the rate of LDPC codes as a function of minimum distance
• Bounds on the minimum code distance for nonbinary codes based on bipartite graphs

This page was built for publication: Upper bound on the minimum distance of LDPC codes over \(\mathrm{GF}(q)\) based on counting the number of syndromes

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