𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Near-vector spaces determined by finite fields

✍ Scribed by Howell, K.-T.; Meyer, J.H.

Book ID
121355354
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
209 KB
Volume
398
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

πŸ“œ 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

A combinatorial problem for vector space
A combinatorial problem for vector spaces over finite fields
✍ Harald Niederreiter πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 767 KB

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