URN to cite this document: urn:nbn:de:bvb:703-epub-5128-8
Title data
dela Cruz, Romar ; Kurz, Sascha:
On the maximum number of minimal codewords.
Bayreuth
,
2020
. - 13 S.
|
|||||||||
Download (279kB)
|
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
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 |
DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics |
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 |
Language: | English |
Originates at UBT: | Yes |
URN: | urn:nbn:de:bvb:703-epub-5128-8 |
Date Deposited: | 21 Oct 2020 10:05 |
Last Modified: | 21 Oct 2020 10:05 |
URI: | https://epub.uni-bayreuth.de/id/eprint/5128 |