Optimal subspace codes in \rm PG(4,q)

2018/02/27 by Antonio Cossidente, Francesco Pavese, Cossidente, Antonio +3
Computer Science · Engineering · #Advanced Wireless Communication Technologies #Coding theory and cryptography #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.1802.09793

openalex publication_date 2018/02/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We investigate subspace codes whose codewords are subspaces of \rm PG(4,q) having non-constant dimension. In particular, examples of optimal mixed-dimension subspace codes are provided, showing that \cal A_q(5,3) = 2(q³+1).

Related

• Subspace codes in PG(2n-1,q)
• Veronese subspace codes
• Subspace code constructions
• Tables of subspace codes
• New Construction for Constant Dimension Subspace Codes via a Composite Structure