About Algorithms for Calculation of Covering Radius of Linear Codes

The covering radius is an important parameter of linear codes. Its calculation is an NP-complete problem. There are three main approaches to its computing that can be considered. The first method is based on traversing the cosets of the linear code. The second method uses the parity-check matrix of the code to calculate the covering radius. The third method is based on fast Walsh-Hadamard transforms for the binary case and Vilenkin-Chrestenson transform for the non-binary case. In this work, the first two approaches are considered and some of the features of their implementations are presented.