Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Kohnert, Axel."'
Autor:
Kiermaier, Michael, Kohnert, Axel
Publikováno v:
In Proceedings of the Fifth International Workshop on Optimal Codes and Related Topics 2007, pages 112-119, 2007
It is known that some good linear codes over a finite ring (R-linear codes) arise from interesting point constellations in certain projective geometries. For example, the expurgated Nordstrom-Robinson code, a nonlinear binary [14,6,6]-code which has
Externí odkaz:
http://arxiv.org/abs/1503.02932
In this article, three types of joins are introduced for subspaces of a vector space. Decompositions of the Gra{\ss}mannian into joins are discussed. This framework admits a generalization of large set recursion methods for block designs to subspace
Externí odkaz:
http://arxiv.org/abs/1411.7181
A $t\text{-}(n,k,\lambda;q)$-design is a set of $k$-subspaces, called blocks, of an $n$-dimensional vector space $V$ over the finite field with $q$ elements such that each $t$-subspace is contained in exactly $\lambda$ blocks. A partition of the comp
Externí odkaz:
http://arxiv.org/abs/1305.1455
Based on ideas of K\"otter and Kschischang we use constant dimension subspaces as codewords in a network. We show a connection to the theory of q-analogues of a combinatorial designs, which has been studied in Braun, Kerber and Laue as a purely combi
Externí odkaz:
http://arxiv.org/abs/1005.2839
Autor:
Kohnert, Axel
A new [48,16,16] optimal linear binary block code is given. To get this code a general construction is used which is also described in this paper. The construction of this new code settles an conjecture mentioned in a 2008 paper by Janosov et al. whe
Externí odkaz:
http://arxiv.org/abs/0912.4107
We give results on the question of code optimality for linear codes over finite Frobenius rings for the homogeneous weight. This article improves on the existing Plotkin bound derived in an earlier paper, and suggests a version of a Singleton bound.
Externí odkaz:
http://arxiv.org/abs/0905.1313
Autor:
Kohnert, Axel, Kurz, Sascha
Publikováno v:
Lecture Notes Computer Science Vol. 5393, 2008, p. 31 - 42
In this paper we construct constant dimension space codes with prescribed minimum distance. There is an increased interest in space codes since a paper by Koetter and Kschischang were they gave an application in network coding. There is also a connec
Externí odkaz:
http://arxiv.org/abs/0807.3212
Autor:
Kohnert, Axel, Kurz, Sascha
There are many papers studying properties of point sets in the Euclidean space $\mathbb{E}^m$ or on integer grids $\mathbb{Z}^m$, with pairwise integral or rational distances. In this article we consider the distances or coordinates of the point sets
Externí odkaz:
http://arxiv.org/abs/0804.1299
Autor:
Kohnert, Axel
We construct new linear codes with high minimum distance d. In at least 12 cases these codes improve the minimum distance of the previously known best linear codes for fixed parameters n,k. Among these new codes there is an optimal ternary [88,8,54]
Externí odkaz:
http://arxiv.org/abs/cs/0701112