at Google ScholarTitle data
dela Cruz, Romar ; Kurz, Sascha:
On the maximum number of minimal codewords.
In: Discrete Mathematics.
Vol. 344
(2021)
Issue 9
.
- No. 112510.
ISSN 0012-365X
DOI: https://doi.org/10.1016/j.disc.2021.112510
Abstract in another language
Minimal codewords have applications in decoding linear codes and in cryptography. We study the maximum number of minimal codewords in binary linear codes of a given length and dimension. Improved lower and upper bounds on the maximum number are presented. We determine the exact values for the case of linear codes of dimension k and length k+2 and for small values of the length and dimension. We also give a formula for the number of minimal codewords of linear codes of dimension k and length k+3.
Further data
| Item Type: | Article in a journal |
|---|---|
| Refereed: | Yes |
| Keywords: | Minimal codewords; Bounds for codes; Exact values |
| Institutions of the University: | Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematical Economics Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematical Economics > Chair Mathematical Economics - Univ.-Prof. Dr. Jörg Rambau Faculties Faculties > Faculty of Mathematics, Physics und Computer Science Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics |
| Result of work at the UBT: | Yes |
| DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics |
| Date Deposited: | 18 Jun 2021 08:26 |
| Last Modified: | 15 Feb 2022 12:42 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/66045 |