Implementation of an algorithm to compute the strong apparent distance of bivariate codes
Published in: Journal of Physics: Conference Series (2019)
Abstract preview: AbstractWe implement and analyze an algorithm to compute the strong apparent distance of bivariate codes, a quantity linked to lower bounds on minimum distance in abelian-code families. Building on the extension from classical BCH bounds to apparent-distance formulations, the work operationalizes the hypermatrix-bas...
Abstract
We implement and analyze an algorithm to compute the strong apparent distance of bivariate codes, a quantity linked to lower bounds on minimum distance in abelian-code families. Building on the extension from classical BCH bounds to apparent-distance formulations, the work operationalizes the hypermatrix-based procedure introduced for strong apparent distance computation. Our implementation translates the theoretical construction into an executable workflow suitable for experimentation and reproducibility. This provides a practical tool for researchers working on coding-theory bounds and algorithmic evaluation of structured codes.
Recommended citation: Bueno-Carreño, D. H., & López, J. M. (2019, January). Implementation of an algorithm to compute the strong apparent distance of bivariate codes. In Journal of Physics: Conference Series (Vol. 1160, No. 1, p. 012012). IOP Publishing. https://iopscience.iop.org/article/10.1088/1742-6596/1160/1/012012/meta
