Some weights of linear codes over finite fields
Loading...
Date
2024-06-09
Journal Title
Journal ISSN
Volume Title
Publisher
Mohamed Boudiaf University of M'sila
Abstract
Linear codes can have different weights, which are measures of the distance between codewords. The most common weights are Hamming, Lee, and Distribution weights, in which
Hamming and Lee weight counts the number of nonzero positions in a codeword, as they determine the error-correcting capability of the code. The weight distribution of a code, which
specifies how many codewords have each possible weight, it can be used to compute the error probability of the code under various decoding algorithms. They are utilized in various
applications within coding theory, and one of its most important uses is detecting and correcting errors. In this work, we study some weights of linear codes over finite fields and their results.
Description
Keywords
Finite fields, Linear codes, Weights