From ds-Bounds for Cyclic Codes to True Minimum Distance for Abelian Codes

In this paper, we develop a technique to extend any bound for the minimum distance of cyclic codes constructed from its defining sets (ds-bounds) to Abelian (or multivariate) codes through the notion of B-apparent distance. We also study conditions for an Abelian code to verify that its B-apparent distance reaches its (true) minimum distance. Then, we construct some codes as an application.