6,645 research outputs found
On the lengths of divisible codes
In this article, the effective lengths of all -divisible linear codes
over with a non-negative integer are determined. For that
purpose, the -adic expansion of an integer is introduced. It is
shown that there exists a -divisible -linear code of
effective length if and only if the leading coefficient of the
-adic expansion of is non-negative. Furthermore, the maximum weight
of a -divisible code of effective length is at most ,
where denotes the cross-sum of the -adic expansion of .
This result has applications in Galois geometries. A recent theorem of
N{\u{a}}stase and Sissokho on the maximum size of a partial spread follows as a
corollary. Furthermore, we get an improvement of the Johnson bound for constant
dimension subspace codes.Comment: 17 pages, typos corrected; the paper was originally named "An
improvement of the Johnson bound for subspace codes
Equidistant Codes in the Grassmannian
Equidistant codes over vector spaces are considered. For -dimensional
subspaces over a large vector space the largest code is always a sunflower. We
present several simple constructions for such codes which might produce the
largest non-sunflower codes. A novel construction, based on the Pl\"{u}cker
embedding, for 1-intersecting codes of -dimensional subspaces over \F_q^n,
, where the code size is is
presented. Finally, we present a related construction which generates
equidistant constant rank codes with matrices of size
over \F_q, rank , and rank distance .Comment: 16 page
Problems on q-Analogs in Coding Theory
The interest in -analogs of codes and designs has been increased in the
last few years as a consequence of their new application in error-correction
for random network coding. There are many interesting theoretical, algebraic,
and combinatorial coding problems concerning these q-analogs which remained
unsolved. The first goal of this paper is to make a short summary of the large
amount of research which was done in the area mainly in the last few years and
to provide most of the relevant references. The second goal of this paper is to
present one hundred open questions and problems for future research, whose
solution will advance the knowledge in this area. The third goal of this paper
is to present and start some directions in solving some of these problems.Comment: arXiv admin note: text overlap with arXiv:0805.3528 by other author
Constant rank-distance sets of hermitian matrices and partial spreads in hermitian polar spaces
In this paper we investigate partial spreads of through the
related notion of partial spread sets of hermitian matrices, and the more
general notion of constant rank-distance sets. We prove a tight upper bound on
the maximum size of a linear constant rank-distance set of hermitian matrices
over finite fields, and as a consequence prove the maximality of extensions of
symplectic semifield spreads as partial spreads of . We prove
upper bounds for constant rank-distance sets for even rank, construct large
examples of these, and construct maximal partial spreads of for a
range of sizes
Classification of large partial plane spreads in and related combinatorial objects
In this article, the partial plane spreads in of maximum possible
size and of size are classified. Based on this result, we obtain the
classification of the following closely related combinatorial objects: Vector
space partitions of of type , binary MRD
codes of minimum rank distance , and subspace codes with parameters
and .Comment: 31 pages, 9 table
A geometric proof of the upper bound on the size of partial spreads in H(4n+1, q²)
We give a geometric proof of the upper bound of q(2n+1) + 1 on the size of partial spreads in the polar space H(4n + 1, q(2)). This bound is tight and has already been proved in an algebraic way. Our alternative proof also yields a characterization of the partial spreads of maximum size in H(4n + 1, q(2))
- …