2013/08/28 by Tuvi Etzion, Etzion, Tuvi, Netanel Raviv +1 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Wireless Network Optimization #Coding theory and cryptography #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.1308.6231
16 pages
openalex publication_date 2013/08/28 · arxiv created 2015/05/05 · arxiv updated 2015/05/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Equidistant codes over vector spaces are considered. For k-dimensional subspaces over a large vector space the largest code is always a sunflower. We present several simple constructions for such codes which might produce the largest non-sunflower codes. A novel construction, based on the Plücker embedding, for 1-intersecting codes of k-dimensional subspaces over \Fqn, n ≥ \binomk+12, where the code size is \fracqk+1-1q-1 is presented. Finally, we present a related construction which generates equidistant constant rank codes with matrices of size n × \binomn2 over \Fq, rank n-1, and rank distance n-1.