A lower bound on the expansion of product codes
Received: 15 Sep 2026 Revised: 18 Oct 2026 Accepted: 19 Oct 2026
Published: 2026, vol. 30, issue 4, pp. 306–309
Abstract
The paper is devoted to the study of the product expansion coefficient of linear codes — a parameter arising in the study of coboundary expansion and constructions of locally testable and quantum codes. For an \(m\)-dimensional product of linear codes of the same length \(n\), we obtain the general lower bound \(\rho \geq 1/(\lceil m/2\rceil n^{\lceil m/2\rceil })\). In addition, in the three-dimensional case, we construct a family of codes based on Reed–Solomon codes for which the expansion coefficient is of order \(1/n^2\). Thus, for \(m=3\), the obtained lower bound is asymptotically tight.
Keywords: linear codes, product codes, product expansion, coboundary expansion.
BibTeX
@article{IS-Yusufova-Kalachev2026,
author = {Yusufova, Alina Almasovna and Kalachev, Gleb Vyacheslavovich},
title = {{A lower bound on the expansion of product codes}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {306--309},
}
AMSBIB
\Bibitem{IS-Yusufova-Kalachev2026}
\by A.\,A.~Yusufova, G.\,V.~Kalachev
\paper A lower bound on the expansion of product codes
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 306--309
\lang In Russian
RU