Titlebar

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

 

On the lengths of divisible codes

Title data

Kiermaier, Michael ; Kurz, Sascha:
On the lengths of divisible codes.
2018
Event: Kolloquium über Kombinatorik (KolKom) , 23. bis 24. Nov. 2018 , Universität Paderborn.
(Conference item: Conference , Speech )

Official URL: Volltext

Abstract in another language

A linear code C is said to be Δ-divisible if all its Hamming weights are multiples of Δ. The main case of interest is that Δ is a power of the characteristic of the base field. Divisible codes have been introduced by Ward in 1981. His divisible code bound restricts the dimension of divisible codes.

In this talk, we focus on the lengths of q^r-divisible

Further data

Item Type: Conference item (Speech)
Refereed: No
Institutions of the University: Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics II
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics in Economy
Faculties
Faculties > Faculty of Mathematics, Physics und Computer Science
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics
Result of work at the UBT: Yes
DDC Subjects: 500 Science > 510 Mathematics
Date Deposited: 07 Dec 2018 07:48
Last Modified: 07 Dec 2018 07:48
URI: https://eref.uni-bayreuth.de/id/eprint/46599