An Extension of the Brouwer–Zimmermann Algorithm for Calculating the Minimum Weight of a Linear Code

A modification of the Brouwer–Zimmermann algorithm for calculating the minimum weight of a linear code over a finite field is presented. The aim was to reduce the number of codewords for consideration. The reduction is significant in cases where the length of a code is not divisible by its dimension...

Full description

Bibliographic Details
Published in:Mathematics
Main Authors: Stefka Bouyuklieva, Iliya Bouyukliev
Format: Article
Language:English
Published: MDPI AG 2021-09-01
Subjects:
linear code
Hamming weight
Brouwer–Zimmermann algorithm
Online Access:https://www.mdpi.com/2227-7390/9/19/2354

Internet

https://www.mdpi.com/2227-7390/9/19/2354

Similar Items