Name
Abstract | ||
|---|---|---|
In this paper, we consider new results on (k, n)-caps with n 2. We provide a lower bound on the size of such caps. Furthermore, we generalize two product constructions for (k, 2)-caps to caps with larger n. We give explicit constructions for good caps with small n. In particular, we determine the largest size of a (k, 3)-cap in PG(3, 5), which turns out to be 44. The results on caps in PG(3, 5) provide a solution to four of the eight open instances of the main coding theory problem for q = 5 and k = 4. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s10623-010-9398-4 | Des. Codes Cryptography |
Keywords | Field | DocType |
Caps,Multiple caps,Linear codes,Griesmer bound,Griesmer codes,Finite projective geometries,51E22,94B05,94B65 | Discrete mathematics,Combinatorics,Upper and lower bounds,Coding theory,Mathematics,Projective test,Griesmer bound | Journal |
Volume | Issue | ISSN |
56 | 2-3 | 0925-1022 |
Citations | PageRank | References |
3 | 0.43 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yves Edel | 1 | 141 | 17.61 |
| Ivan Landjev | 2 | 28 | 5.17 |