当前位置: X-MOL 学术Mathematics › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An Extension of the Brouwer–Zimmermann Algorithm for Calculating the Minimum Weight of a Linear Code
Mathematics ( IF 2.4 ) Pub Date : 2021-09-22 , DOI: 10.3390/math9192354
Stefka Bouyuklieva , Iliya Bouyukliev

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.

中文翻译:

用于计算线性代码最小权重的 Brouwer-Zimmermann 算法的扩展

提出了用于计算有限域上线性代码的最小权重的 Brouwer-Zimmermann 算法的修改。目的是减少要考虑的代码字的数量。在代码长度不能被其尺寸整除的情况下,这种减少是显着的。所提出的算法还可用于查找权重小于给定常数的所有码字。该算法在软件包QextNewEdition 中实现
更新日期:2021-09-22
down
wechat
bug