AN ALGORITHM FOR COMPUTING THE COVERING RADIUS OF A LINEAR CODE BASED ON VILENKIN-CHRESTENSON TRANSFORM

DOI10.1142/9789811248108_0007MaRDI QIDQ6178018zbMATH OpenOpenAlexFDO

Authors Paskal Piperkov, Iliya G. Bouyukliev, Stefka Bouyuklieva

Publication date 1 September 2023

Published in New Horizons in Differential Geometry and its Related Fields (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2202.12111

zbMATH Keywords

covering radiuslinear codeweight distribution

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: We present a generalization of Walsh-Hadamard transform that is suitable for applications in Coding Theory, especially for computation of the weight distribution and the covering radius of a linear code over a finite field. The transform used in our research, is a modification of Vilenkin-Chrestenson transform. Instead of using all the vectors in the considered space, we take a maximal set of nonproportional vectors, which reduces the computational complexity.

Recommendations

• Weight distribution of translates, covering radius, and perfect codes correcting errors of given weights
• AN ALGORITHM FOR COMPUTING THE WEIGHT DISTRIBUTION OF A LINEAR CODE OVER A COMPOSITE FINITE FIELD WITH CHARACTERISTIC 2
• A new approach to the covering radius of codes
• scientific article; zbMATH DE number 1057736
• On the covering radius of cyclic linear codes and arithmetic codes

This page was built for publication: AN ALGORITHM FOR COMPUTING THE COVERING RADIUS OF A LINEAR CODE BASED ON VILENKIN-CHRESTENSON TRANSFORM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178018)