92 research outputs found
The order of the automorphism group of a binary -analog of the Fano plane is at most two
It is shown that the automorphism group of a binary -analog of the Fano
plane is either trivial or of order .Comment: 10 page
Construction of Codes for Network Coding
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 combinatorial object. For the construction of network
codes we successfully modified methods (construction with prescribed
automorphisms) originally developed for the q-analogues of a combinatorial
designs. We then give a special case of that method which allows the
construction of network codes with a very large ambient space and we also show
how to decode such codes with a very small number of operations
Tables of subspace codes
One of the main problems of subspace coding asks for the maximum possible
cardinality of a subspace code with minimum distance at least over
, where the dimensions of the codewords, which are vector
spaces, are contained in . In the special case of
one speaks of constant dimension codes. Since this (still) emerging
field is very prosperous on the one hand side and there are a lot of
connections to classical objects from Galois geometry it is a bit difficult to
keep or to obtain an overview about the current state of knowledge. To this end
we have implemented an on-line database of the (at least to us) known results
at \url{subspacecodes.uni-bayreuth.de}. The aim of this recurrently updated
technical report is to provide a user guide how this technical tool can be used
in research projects and to describe the so far implemented theoretic and
algorithmic knowledge.Comment: 44 pages, 6 tables, 7 screenshot
- …