Some weights of linear codes over finite fields
| dc.contributor.author | Benia, Nihal | |
| dc.contributor.author | LEBED, Khawla: Supervisor | |
| dc.date.accessioned | 2024-07-22T08:57:16Z | |
| dc.date.available | 2024-07-22T08:57:16Z | |
| dc.date.issued | 2024-06-09 | |
| dc.description.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. | |
| dc.identifier.uri | https://dspace.univ-msila.dz/handle/123456789/43999 | |
| dc.language.iso | en | |
| dc.publisher | Mohamed Boudiaf University of M'sila | |
| dc.subject | Finite fields | |
| dc.subject | Linear codes | |
| dc.subject | Weights | |
| dc.title | Some weights of linear codes over finite fields | |
| dc.type | Thesis |