On the maximum number of minimal codewords (Q2037586)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7369639
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the maximum number of minimal codewords |
scientific article; zbMATH DE number 7369639 |
Statements
On the maximum number of minimal codewords (English)
0 references
8 July 2021
0 references
The authors determine the maximum number of minimal codewords \(M_2(n,k)\) for binary linear codes of dimension \(k\) and length \(n=k + 2\). In the case of dimension \(k\) and length \(k + 3\), they give a formula for the number of minimal codewords. The results are based on the more general properties of minimal codewords proved by authors in the paper. For values of \(n\) and \(k\) in \([1,15]\) a table with the exact values of \(M_2(n,k)\) is given, too.
0 references
minimal codewords
0 references
bounds for codes
0 references
exact values
0 references
0.8544608354568481
0 references
0.8541596531867981
0 references
0.8018666505813599
0 references
0.7662835717201233
0 references
