DOI zum Zitieren der Version auf EPub Bayreuth: https://doi.org/10.15495/EPub_UBT_00004877
URN to cite this document: urn:nbn:de:bvb:703-epub-4877-1
URN to cite this document: urn:nbn:de:bvb:703-epub-4877-1
Title data
dela Cruz, Romar ; Kiermaier, Michael ; Kurz, Sascha ; Wassermann, Alfred:
On the minimum number of minimal codewords.
Bayreuth
,
2020
. - 9 S.
This is the latest version of this item.
|
|||||||||
Download (203kB)
|
Project information
Project financing: |
Alexander von Humboldt-Stiftung |
---|
Abstract
We study the minimum number of minimal codewords in linear codes from the point of view of projective geometry. We derive bounds and in some cases determine the exact values. We also present an extension to minimal subcode supports.
Further data
Available Versions of this Item
-
On the minimum number of minimal codewords. (deposited 07 Jan 2020 08:23)
- On the minimum number of minimal codewords. (deposited 15 Jun 2020 07:39) [Currently Displayed]