𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Erdös distance problem in vector spaces over finite fields

✍ Scribed by Iosevich, A.; Rudnev, M.


Book ID
124060145
Publisher
American Mathematical Society
Year
2007
Tongue
English
Weight
256 KB
Volume
359
Category
Article
ISSN
0002-9947

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