Literature by the same author
plus at Google Scholar

Bibliografische Daten exportieren
 

Divisible Codes

Title data

Kurz, Sascha:
Divisible Codes.
Bayreuth , 2022 . - II, 102 p.
DOI: https://doi.org/10.15495/EPub_UBT_00006811

Warning
There is a more recent version of this item available.

Official URL: Volltext

Abstract in another language

A linear code over GF(q) with the Hamming metric is called Δ-divisible if the weights of all codewords are divisible by Δ. They have been introduced by Harold Ward a few decades ago. Applications include subspace codes, partial spreads, vector space partitions, and distance optimal codes. The determination of the possible lengths of projective divisible codes is an interesting and comprehensive challenge.

Further data

Item Type: Preprint, postprint
Keywords: divisible codes; partial spreads; vector space partitions; subspace codes
Subject classification: Mathematics Subject Classification Code: 94B05 (51E23)
Institutions of the University: Faculties > Faculty of Mathematics, Physics und Computer Science
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
Result of work at the UBT: Yes
DDC Subjects: 000 Computer Science, information, general works > 004 Computer science
500 Science > 510 Mathematics
Date Deposited: 23 Dec 2022 06:43
Last Modified: 23 Dec 2022 06:43
URI: https://eref.uni-bayreuth.de/id/eprint/73195

Available Versions of this Item