Login
Publications by the same author
plus in the repository
plus in Google Scholar
Bibliografische Daten exportieren		  

Divisible Codes

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

Title data

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

This is the latest version of this item.

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

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-7397-6
Date Deposited: 19 Jan 2024 10:11
Last Modified: 19 Jan 2024 10:57
URI: https://epub.uni-bayreuth.de/id/eprint/7397

Available Versions of this Item

Download Statistics

Downloads

Downloads per month over past year