Product Expansion of LDPC Codes
Received: 18 Oct 2026 Accepted: 19 Oct 2026
Published: 2026, vol. 30, issue 4, pp. 274–277
Abstract
We study the product expansion property of LDPC codes. It is known that the product of two expander LDPC codes is robustly testable, which in the two-dimensional case is equivalent to product expansion. In this work, we show that the product expansion of any number of expander LDPC codes is bounded below by a positive constant. Since random LDPC codes with certain parameters are expander codes with high probability, our result covers a wide class of codes. Previously, for three or more binary codes, product expansion was known only for locally testable codes and some of their subcodes.
Keywords: tensor product of codes, LDPC codes, expander codes, product expansion.
BibTeX
@article{IS-Kalachev2026,
author = {Kalachev, Gleb Vyacheslavovich},
title = {{Product Expansion of LDPC Codes}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {274--277},
}
AMSBIB
\Bibitem{IS-Kalachev2026}
\by G.\,V.~Kalachev
\paper Product Expansion of LDPC Codes
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 274--277
\lang In Russian
RU