Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777306 | Electronic Notes in Discrete Mathematics | 2017 | 6 Pages |
Abstract
We investigate the following version of the main problem of coding theory: Given the integer k and the prime power q, what is the value oftq(k):=maxdâ¡nq(k,d)âgq(k,d). We give several formulations of this problem: in terms of linear codes, arcs and minihypers. We provide general constructions that give upper bounds on tq(k).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ivan Landjev, Assia Rousseva,