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

DOI10.1134/S0032946016010026zbMath1365.94512OpenAlexW2414355959MaRDI QIDQ522923

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)

Cites Work

• Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
• A new upper bound on nonbinary block codes
• Upper bounds on the rate of LDPC codes as a function of minimum distance
• A recursive approach to low complexity codes
• Unnamed Item

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