Zobrazeno 1 - 10
of 84
pro vyhledávání: '"Honold, Thomas"'
We present various new constructions and bounds for arcs in projective Hjelmslev planes over finite chain rings of nilpotency index 2. For the chain rings of cardinality at most 25 we give updated tables with the best known upper and lower bounds for
Externí odkaz:
http://arxiv.org/abs/2409.02099
A projective linear code over $\mathbb{F}_q$ is called $\Delta$-divisible if all weights of its codewords are divisible by $\Delta$. Especially, $q^r$-divisible projective linear codes, where $r$ is some integer, arise in many applications of collect
Externí odkaz:
http://arxiv.org/abs/1912.10147
It is shown that there does not exist a binary projective triply-even code of length $59$. This settles the last open length for projective triply-even binary codes. Therefore, projective triply-even binary codes exist precisely for lengths $15$, $16
Externí odkaz:
http://arxiv.org/abs/1812.05957
Subspace codes, i.e., sets of subspaces of $\mathbb{F}_q^v$, are applied in random linear network coding. Here we give improved upper bounds for their cardinalities based on the Johnson bound for constant dimension codes.
Comment: 16 pages, typo
Comment: 16 pages, typo
Externí odkaz:
http://arxiv.org/abs/1808.03580
Publikováno v:
The Australasian Journal of Combinatorics. Vol. 73 (2019) Issue 1 . - pp. 162-178
A vector space partition $\mathcal{P}$ in $\mathbb{F}_q^v$ is a set of subspaces such that every $1$-dimensional subspace of $\mathbb{F}_q^v$ is contained in exactly one element of $\mathcal{P}$. Replacing "every point" by "every $t$-dimensional subs
Externí odkaz:
http://arxiv.org/abs/1803.10180
Publikováno v:
Rings, Modules and Codes, 117-129, Contemp. Math., 727, AMS
We give a sufficient condition for a bi-invariant weight on a Frobenius bimodule to satisfy the extension property. This condition applies to bi-invariant weights on a finite Frobenius ring as a special case. The complex-valued functions on a Frobeni
Externí odkaz:
http://arxiv.org/abs/1711.09939
The maximum size $A_2(8,6;4)$ of a binary subspace code of packet length $v=8$, minimum subspace distance $d=6$, and constant dimension $k=4$ is $257$, where the $2$ isomorphism types are extended lifted maximum rank distance codes. In finite geometr
Externí odkaz:
http://arxiv.org/abs/1711.06624
For which positive integers $n,k,r$ does there exist a linear $[n,k]$ code $C$ over $\mathbb{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 stud
Externí odkaz:
http://arxiv.org/abs/1703.08291
Publikováno v:
Journal of Algebraic Combinatorics; Nov2024, Vol. 60 Issue 3, p667-688, 22p
