Projective divisible binary codes

arXiv1703.08291MaRDI QIDQ6284747FDOQ6284747

Authors: Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann

Publication date: 24 March 2017

Abstract: For which positive integers

n, k, r

does there exist a linear

[n, k]

code

C

over

m a t h b b F_{q}

with all codeword weights divisible by

q^{r}

and such that the columns of a generating matrix of

C

are projectively distinct? The motivation for studying this problem comes from the theory of partial spreads, or subspace codes with the highest possible minimum distance, since the set of holes of a partial spread of

r

-flats in

o p e r a t o r n a m e P G (v - 1, m a t h b b F_{q})

corresponds to a

q^{r}

-divisible code with

k l e q v

. In this paper we provide an introduction to this problem and report on new results for

q = 2

.

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Spreads and packing problems in finite geometry (51E23)

This page was built for publication: Projective divisible binary codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284747)