๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A combinatorial problem for vector spaces over finite fields

โœ Scribed by Harald Niederreiter

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
767 KB
Volume
96
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

We study a combinatorial problem for vector spaces over finite fields which generalizes the following classical problem in algebraic coding theory: given a finite field Fq and integers n > k 2 1, find the largest minimum distance that can be achieved by a linear code over Fq with fixed length n and fixed dimension k.

๐Ÿ“œ SIMILAR VOLUMES

Graph covering projections arising from
Graph covering projections arising from finite vector spaces over finite fields
โœ M. Hofmeister ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 655 KB

It is well known that regular graph covering projections may be described by certain voltage assignments. Further investigations can be done if the voltage group is abelian. The purpose of this paper is to classify isomorphism of regular graph covering projections of a graph G that arise from finite

Invariant Subspaces of the Ring of Funct
Invariant Subspaces of the Ring of Functions on a Vector Space over a Finite Field
โœ Nicholas J Kuhn ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 270 KB

If F is the finite field of characteristic p and order q s p , let F F q be the q category whose objects are functors from finite dimensional F -vector spaces to q F -vector spaces, and with morphisms the natural transformations between such q functors. ลฝ . A fundamental object in F F q is the injec