2020/09/14 by Giovanni Longobardi, Longobardi, Giovanni, Leo Storme +3
Computer Science · Engineering · #05D99 #51E20 #Coding theory and cryptography #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Mathematics #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2009.06792
openalex publication_date 2020/09/14 · openalex created_date 2022/07/25 · openalex updated_date 2026/07/28
In this article, constant dimension subspace codes whose codewords have\nsubspace distance in a prescribed set of integers, are considered. The easiest\nexample of such an object is a it junta; i.e. a subspace code in which all\ncodewords go through a common subspace. We focus on the case when only two\nintersection values for the codewords, are assigned. In such a case we\ndetermine an upper bound for the dimension of the vector space spanned by the\nelements of a non-junta code. In addition, if the two intersection values are\nconsecutive, we prove that such a bound is tight, and classify the examples\nattaining the largest possible dimension as one of four infinite families.\n