Name
Abstract | ||
|---|---|---|
A computer-supported recursive construction for large caps in projective space PG(r,4) is presented. Using this recursive construction, we construct a 2136-cap in PG(8,4), a 5124-cap in PG(9,4), a 15840-cap in PG(10,4), a 36084-cap in PG(11,4) and a 95256-cap in PG(12,4). The first four caps are larger than the known largest 2110-cap, 5040-cap, 15423-cap and 34566-cap respectively. Then we propose a fast algorithm for checking completeness of a cap based on a bijective map φ between points in PG(r,4) and a subset I of the positive integer set N. Completeness of the new caps is checked. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ffa.2015.04.006 | Finite Fields and Their Applications |
Keywords | Field | DocType |
51E20,51E21,51E22 | Integer,Discrete mathematics,Combinatorics,Bijection,Completeness (statistics),Recursion,Mathematics,Projective space | Journal |
Volume | Issue | ISSN |
35 | C | 1071-5797 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qiang Fu | 1 | 791 | 81.92 |
| Ruihu Li | 2 | 34 | 6.11 |
| Luobin Guo | 3 | 14 | 4.00 |
| Gen Xu | 4 | 1 | 1.03 |