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

A combinatorial construction for products of linear transformations over a finite field

โœ Scribed by I.P Goulden; D.M Jackson


Book ID
107885133
Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
163 KB
Volume
53
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A combinatorial problem for vector space
โœ 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