Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/4098

 Title: An Extension of the Brouwer–Zimmermann Algorithm for Calculating the MinimumWeight of a Linear Code Authors: Bouyuklieva, StefkaBouyukliev, Iliya Keywords: Linear CodeHamming WeightBrouwer–Zimmermann Algorithm Issue Date: 22-Sep-2021 Publisher: MDPI Citation: Bouyuklieva, S.; Bouyukliev, I. An Extension of the Brouwer–Zimmermann Algorithm for Calculating the MinimumWeight of a Linear Code. Mathematics, 2021, 9, 2354. https://doi.org/10.3390/math9192354 Series/Report no.: Mathematics;9, 2354 Abstract: 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 dimensions. The proposed algorithm can also be used to find all codewords of weight less than a given constant. The algorithm is implemented in the software package QextNewEdition. URI: http://hdl.handle.net/10525/4098 ISSN: 2227-7390 Appears in Collections: Q1

Files in This Item:

File Description SizeFormat