at Google ScholarTitle data
dela Cruz, Romar ; Kurz, Sascha:
On the maximum number of minimal codewords.
Bayreuth
,
2020
. - 13 p.
DOI: https://doi.org/10.15495/EPub_UBT_00005128
Project information
| Project title: |
Project's official title Project's id On error-correcting codes from graphs No information |
|---|---|
| Project financing: |
Alexander von Humboldt-Stiftung |
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: | Preprint, postprint |
|---|---|
| Keywords: | minimal codewords; bounds for codes; exact values |
| Institutions of the University: | Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics 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 |
| Result of work at the UBT: | Yes |
| DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics |
| Date Deposited: | 24 Oct 2020 21:00 |
| Last Modified: | 26 Oct 2020 06:51 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/58741 |