Work

About Algorithms for Calculation of Covering Radius of Linear Codes

Year: 2024

Type: article

Abstract: 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.

Source: Innovative STEM Education

DOI: 10.55630/stem.2024.0609

Authors: Maria Pashinska-Gadzheva, Iliya Bouyukliev

Institutions: Bulgarian Academy of Sciences, Institute of Mathematics and Informatics

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W4405724936

FWCI:

Cites: 3

Cited by:

Related to: 10