Titlebar

Export bibliographic data
Literature by the same author
plus on the publication server
plus at Google Scholar

 

Divisible Codes

DOI zum Zitieren der Version auf EPub Bayreuth: https://doi.org/10.15495/EPub_UBT_00005931
URN to cite this document: urn:nbn:de:bvb:703-epub-5931-3

Title data

Kurz, Sascha:
Divisible Codes.
Bayreuth , 2021 . - II, 102 S.

[img]
Format: PDF
Name: chap_div_codes_arxiv.pdf
Version: Published Version
Available under License Creative Commons BY 4.0: Attribution
Download (689kB)

Abstract

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)
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
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
Language: English
Originates at UBT: Yes
URN: urn:nbn:de:bvb:703-epub-5931-3
Date Deposited: 13 Jan 2022 07:08
Last Modified: 13 Jan 2022 07:08
URI: https://epub.uni-bayreuth.de/id/eprint/5931

Downloads

Downloads per month over past year