Subspace Codes Based on Partial Injective Maps of Vector Spaces Over Finite Fields

Abstract

Subspace codes are widely used in error corrections of random network coding. In this article, subspace codes based on partial injective maps of vector spaces over finite fields are considered. Several bounds of the subspace codes (n, M, 2b, e)q based on e-partial injective maps of F(n)q are presented. The anticode bound and Ahlswede-Aydinian bound of the subspace codes (n, M, 2b, e)q are obtained by using the EKR theorem for e-partial injective maps of F(n)q . Finally, we show that the (n, M, 2b, e)q subspace codes based on e-partial injective maps of F(n)q reach the Wang-Xing-Safavi-Naini bound if and only if they are certain Steiner structures in Ine.

Keywords

• Subspace codes
• partial injective maps
• bounds
• EKR theorem
• finite fields