### Citations

374 |
An algebraic approach to the association schemes of coding theory,
- Delsarte
- 1973
(Show Context)
Citation Context ...hods to obtain upper bounds on ASq (n, d) are various types of linear programming methods. The linear programming method suggested in [50] is different from the classic linear programming of Delsarte =-=[36]-=-. The classic linear programming does not yield any improvements, when applied for bounds on codes in Gq(n, k) or in Pq(n). A somehow stronger method is the semidefinite programming [90, 91] as sugges... |

343 | Improved decoding of Reed-Solomon and Algebraic-Geometric codes
- Guruswami, Sudan
- 1999
(Show Context)
Citation Context ...ance or the injection distance. Quite naturally also list-decoding algorithms were developed for Grassmannian codes (constructed either by linearlized polynomials or as lifted rank-metric codes), e.g =-=[2, 59, 60, 73, 74, 75, 76, 85, 111]-=-. Also, this direction of research has many problems for future research. Research problem 56. Suggest new classes of large Grassmannian codes, subspace codes (with the subspace distance or the inject... |

256 | Coding for errors and erasures in random network coding
- Kötter, Kschischang
- 2008
(Show Context)
Citation Context ...s. In recent years there has been an increasing interest in subspace codes as a result of their application to error-correction in random network coding as was demonstrated by Koetter and Kschischang =-=[70]-=-. But, the interest in these codes has been also before this application, since Grassmannian codes are q-analogs of the well studied constant weight codes [23]. For example, the nonexistence of nontri... |

161 |
Theory of codes with maximum rank distance
- Gabidulin
- 1985
(Show Context)
Citation Context ...matrices over Fq; they form a linear subspace with dimension ̺ of Fk×ℓq , and for each two distinct codewords A and B we have that dR(A,B) ≥ δ. For a [k × ℓ, ̺, δ] rank-metric code C it was proved in =-=[38, 54, 86]-=- that ̺ ≤ min{k(ℓ− δ + 1), ℓ(k − δ + 1)} . (1) This bound, called the Singleton bound for rank-metric codes, is attained for all feasible parameters. The codes which attain this bound are called maxim... |

158 | A rank-metric approach to error control in random network coding,”
- Silva, Kschischang, et al.
- 2008
(Show Context)
Citation Context ...q . As for lower bounds on Aq(n, δ, k), in [70] there is a construction, of codes based on linearlized polynomials, which yields the bound Aq(n, δ, k) ≥ q(n−k)(k−δ+1). The same bound was developed in =-=[98]-=- by using lifted rank-metric codes. In this context we define the rank distance and rank-metric codes which play an important role in the discussion on subspace codes. For two k × ℓ matrices A and B o... |

123 | A survey of combinatorial Gray codes
- Savage
- 1997
(Show Context)
Citation Context ...and the Grassmannian. We will consider three topics: Gray codes, self-complements codes, and linear codes. 14.1 Gray Codes Gray codes have many applications and they are defined on variety of objects =-=[88]-=-. A Gray code in Pq(n) or Gq(n, k) is a path in the related graphs G(PSq (n)) and G(Gq(n, k)), respectively. In G(PSq (n)) the vertices represent the subspaces of F n q . Two vertices X and Y are conn... |

115 | A new table of constant weight codes
- Brouwer, Shearer, et al.
- 1990
(Show Context)
Citation Context ... demonstrated by Koetter and Kschischang [70]. But, the interest in these codes has been also before this application, since Grassmannian codes are q-analogs of the well studied constant weight codes =-=[23]-=-. For example, the nonexistence of nontrivial perfect codes in the Grassmann scheme was proved in [27, 79]. The well-known concept of q-analogs replaces subsets by subspaces of a vector space over a f... |

99 |
Maximum-rank array codes and their application to crisscross error correction
- Roth
- 1991
(Show Context)
Citation Context ...matrices over Fq; they form a linear subspace with dimension ̺ of Fk×ℓq , and for each two distinct codewords A and B we have that dR(A,B) ≥ δ. For a [k × ℓ, ̺, δ] rank-metric code C it was proved in =-=[38, 54, 86]-=- that ̺ ≤ min{k(ℓ− δ + 1), ℓ(k − δ + 1)} . (1) This bound, called the Singleton bound for rank-metric codes, is attained for all feasible parameters. The codes which attain this bound are called maxim... |

91 |
Bilinear forms over a finite field, with applications to coding theory
- Delsarte
- 1978
(Show Context)
Citation Context ...matrices over Fq; they form a linear subspace with dimension ̺ of Fk×ℓq , and for each two distinct codewords A and B we have that dR(A,B) ≥ δ. For a [k × ℓ, ̺, δ] rank-metric code C it was proved in =-=[38, 54, 86]-=- that ̺ ≤ min{k(ℓ− δ + 1), ℓ(k − δ + 1)} . (1) This bound, called the Singleton bound for rank-metric codes, is attained for all feasible parameters. The codes which attain this bound are called maxim... |

77 |
A comparison of the Delsarte and Lovász bounds
- Schrijver
- 1979
(Show Context)
Citation Context ...g of Delsarte [36]. The classic linear programming does not yield any improvements, when applied for bounds on codes in Gq(n, k) or in Pq(n). A somehow stronger method is the semidefinite programming =-=[90, 91]-=- as suggested in [5] for the projective space. This method and the one in [50] yield all the best known upper bounds on ASq (n, d), when in most cases the semidefinite programming yields better bounds... |

73 | New code upper bounds from the Terwilliger algebra and semidefinite programming
- Schrijver
(Show Context)
Citation Context ...g of Delsarte [36]. The classic linear programming does not yield any improvements, when applied for bounds on codes in Gq(n, k) or in Pq(n). A somehow stronger method is the semidefinite programming =-=[90, 91]-=- as suggested in [5] for the projective space. This method and the one in [50] yield all the best known upper bounds on ASq (n, d), when in most cases the semidefinite programming yields better bounds... |

58 |
Silberstein,Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams
- Etzion, N
- 2009
(Show Context)
Citation Context ... dimension code C. If C is an MRD code then C is called a 4 lifted MRD code [98]. This code will be denoted by CMRD. This code is not maximal and it can be extended by using a multilevel construction =-=[48]-=- as described in the next section. An upper bound on the size of a code which contains CMRD can be found in [49]. Codes based on linearlized polynomials, where each code contains the related code base... |

55 |
Error-Correcting Codes in Projective Space
- Etzion, Vardy
- 2011
(Show Context)
Citation Context ...mension. An (n, δ, k)q code is a subset of Gq(n, k) with minimum Grassmannian distance δ. Let Aq(n, δ, k) denote the maximum size of an (n, δ, k)q code. Koetter and Kschischang [70], Etzion and Vardy =-=[50]-=- developed several upper bounds on Aq(n, δ, k). For a subspace code C we define the orthogonal complement C⊥ as the code which consists of the dual subspaces of C, i.e. C⊥ def ={X⊥ : X ∈ C}. C and C⊥ ... |

53 | Intersection theorems for vector spaces - Frankl, Graham - 1988 |

46 | Construction of large constant dimension codes with a prescribed minimum distance
- Kohnert, Kurz
- 2008
(Show Context)
Citation Context ...k) δ k3 2 3 a9a 2 b77− 81c a21a Bounds on A2(7, δ, k) δ k3 2 3 d17d 2 e329− 381f g31h 6 Bounds on A2(8, δ, k) δ k4 3 2 4 a17a 3 i257− 289j d34d 2 k4797− 6477f e1312− 1493c a85a • a - Theorem 8. • b - =-=[71]-=-. • c - [50]. • d - [41]. • e - [22]. • f - Theorem 2. • g - Theorem 10. • h - Theorem 9. • i - The Multilevel Construction with CMRD. • j - Theorem 1. • k - [49]. Some of the specific values of Aq(n,... |

45 |
On coverings
- Schönheim
- 1964
(Show Context)
Citation Context ...the case of error-correcting codes in the projective space (which are q-packing designs) there are some basic bounds on the size of a q-covering design. The first one is the q-analog Schönheim bound =-=[92]-=- which was given in [52]. Theorem 17. Cq(n, k, r) ≥ ⌈ qn−1 qk−1 Cq(n− 1, k − 1, r − 1) ⌉ . The basic covering bound is given in the following theorem [52]. Theorem 18. Cq(n, k, r) ≥ [nr]q [kr]q with e... |

43 |
Association schemes and t-designs in regular semilattices,
- Delsarte
- 1976
(Show Context)
Citation Context ...stems were subject to an extensive research in combinatorial designs [33]. A Steiner system is also equivalent to an optimal constant weight codes in the Hamming scheme. Cameron [25, 26] and Delsarte =-=[37]-=- have extended the notions of block design and Steiner systems to vector spaces. A Steiner structure (q-Steiner system) Sq(t, k, n) is a collection S of elements from Gq(n, k) (called blocks) such tha... |

41 | On metrics for error correction in network coding,”
- Silva, Kschischang
- 2009
(Show Context)
Citation Context ...tric An (n, d)Iq code is a subspace code in Pq(n) with minimum injection distance d. The injection distance is the one which is more useful, than the subspace distance, from a practical point of view =-=[99]-=-. Let AIq(n, d) denote the maximum number of codewords in an (n, d) I q code. The injection distance is the q-analog of the asymmetric distance [68]. Also, the related graph G(PIq (n)) is not distance... |

32 | Spread Codes and Spread Decoding in Network Coding
- Manganiello, Gorla, et al.
(Show Context)
Citation Context ...s of a very special interest. This value has a special interest since (n, k, k)q codes have applications as byte-correcting codes [43, 65]. Decoding of such constant dimension codes was considered in =-=[58, 77]-=- The known upper and lower bounds on Aq(n, k, k) are summarized in the following theorems. The first three well-known theorems can be found in [50]. Theorem 8. If k divides n then Aq(n, k, k) = qn−1 q... |

30 | Recursive code construction for random networks
- Skachek
(Show Context)
Citation Context ...code which contains CMRD can be found in [49]. Codes based on linearlized polynomials, where each code contains the related code based on linearlized polynomial constructed in [70], were developed in =-=[100]-=-. But, these codes are smaller in size then the codes obtained by the multilevel construction. Another family of Grassmannian codes are codes which admit a certain automorphism group. These kind of co... |

29 | On perfect codes and related concepts
- Ahlswede, Aydinian, et al.
- 2001
(Show Context)
Citation Context ...the existence question of perfect subspace codes with the subspace distance. It was proved in [50] that such codes do not exist. The Johnson space and the Grassmann space admit diameter-perfect codes =-=[4]-=-. All such diameter-perfect codes are optimal for their parameters. Unfortunately, the definition of diameter-perfect codes does not extend to the projective space Pq(n), since the size of a sphere in... |

29 |
A characterization of flat spaces in a finite geometry and the uniqueness of the Hamming and the MacDonald codes
- Bose, Burton
- 1966
(Show Context)
Citation Context ... 1 ≤ k ≤ n, then Cq(n, k, 1) = ⌈ qn−1 qk−1 ⌉ . Theorem 22. If 1 ≤ r ≤ n− 1, then Cq(n, n− 1, r) = qr+1−1 q−1 . Theorem 22 was proved before in the context of projective geometry by Bose and Burton in =-=[16]-=-. Another lower bound was given in [40] by considering sets of lines in PG(2s, q) contained in s-subspaces. Theorem 23. Cq(2s+ 1, 2s− 1, s) ≥ q2s+2−q2 q2−1 + q s+1−1 q−1 for every integer s ≥ 2. Metsc... |

26 |
On the Preparata and Goethals codes
- Baker, Lint, et al.
- 1983
(Show Context)
Citation Context ...q) are known for many years. For q = 2 and odd n there is an 1parallelism in PG(n, 2). Such a parallelism was found in the context of Preparata codes and it is known that many such parallelisms exist =-=[6, 7, 119]-=-. For any other power of a prime q, if n = 2i − 1, i ≥ 2, then an 1-parallelism was shown in [8]. In the last forty years no new parameters for 1-parallelisms were shown until recently, when an 1-para... |

24 | Constant-rank codes and their connection to constant-dimension codes
- Gadouleau, Yan
- 2010
(Show Context)
Citation Context ...relation for subspace codes. However, a specific type of rank-metric codes, namely constant rank codes have an important direct application to constant dimension codes. These codes were considered in =-=[56]-=-. A constant rank code is a rank-metric code in which all codewords have the same rank. Let ARq (m,n, d, r) be the maximum number of codewords in a constant rank code with constant rank r and minimum ... |

23 |
The current status of Turan’s problem on hypergraphs, Extremal problems for finite sets (Visegrad,
- Caen
- 1991
(Show Context)
Citation Context ...tive geometry. A set T of t-subspaces in PG(n, q) such that each s-subspace contains at least one element of T is called 22 a blocking set. Such a design is a q-analog of the well-known Turán design =-=[34, 35]-=-. The dual subspaces of the subspaces in a blocking set form a q-covering design Cq(n+1, n− t, n− s). Blocking sets were considered for example in [82, 83]. We note that blocking sets have also some d... |

23 | Codes and anticodes in the Grassman graph
- Schwartz, Etzion
- 2002
(Show Context)
Citation Context ...ant dimension code which attains the bound of Aq(n, k − t + 1, k). Similarly, to Steiner systems, simple necessary divisibility conditions for the existence of a given Steiner structure are developed =-=[93]-=-. Theorem 6. If a Steiner structure Sq(t, k, n) exists then for each i, 1 ≤ i ≤ t− 1, a Steiner structure Sq(t− i, k − i, n− i) exists. Corollary 1. If a Steiner structure Sq(t, k, n) exists then for ... |

22 |
Designs over finite fields,
- Thomas
- 1987
(Show Context)
Citation Context ...(n, k) such that each t-dimensional subspace of Gq(n, t) is contained in exactly λ blocks of B. If B contains all the k-dimensional subspaces of Gq(n, k) then the design is said to be trivial. Thomas =-=[106]-=- was the first to find nontrivial t-design over Fq, which are not spreads. The work of Thomas has motivated other research work to explore this topic and more t-designs over Fq were found [20, 67, 84,... |

21 |
Intersection theorems for systems of finite vector spaces
- Hsieh
- 1975
(Show Context)
Citation Context ...pace. q-analogs of various combinatorial objects are well known [115, pp. 325-332]. Of special interest are q-analogs in extremal combinatoric as well as other well-known combinatorial problems, e.g. =-=[14, 15, 28, 29, 53, 66]-=-. The related techniques and results might be of usage in coding theory. It turns out that the natural measure of distance in Pq(n) is given by dS(X, Y ) def = dimX + dimY − 2 dim ( X ∩Y ) , for all X... |

20 | Monotone gray codes and the middle levels problem.
- Savage, Winkler
- 1995
(Show Context)
Citation Context ... combinatorial structure as the other two graphs. Another interesting problem in this context is the q-analog of the middle levels problem which is a well-known unsolved problem for the Hamming graph =-=[89]-=-. The q-analog problems are presented as follows. Research problem 96. Is there a cycle in G(PSq (2k+1)) which contains all the k-dimensional subspaces and all the (k + 1)-dimensional subspaces? Resea... |

19 |
Partial spreads in finite projective spaces and partial designs,
- Beutelspacher
- 1975
(Show Context)
Citation Context ...qn − qk(qr − 1)− 1 qk − 1 We note that one method to obtain the lower bound of Theorem 10 is to apply the Multilevel Construction. The next theorem was proved in [65] for q = 2 and for any other q in =-=[9]-=-. 18 Theorem 11. If n ≡ 1 (mod k) then Aq(n, k, k) = qn−q qk−1 − q + 1 = ∑n−1 k −1 i=1 q ik+1 + 1. The bound of Theorem 11 is attained with CMRD to which one subspace is added. By Theorems 8 and 11, t... |

19 |
On the zeros of the Askey-Wilson polynomials, with applications to coding theory,
- Chihara
- 1987
(Show Context)
Citation Context ...his application, since Grassmannian codes are q-analogs of the well studied constant weight codes [23]. For example, the nonexistence of nontrivial perfect codes in the Grassmann scheme was proved in =-=[27, 79]-=-. The well-known concept of q-analogs replaces subsets by subspaces of a vector space over a finite field and their orders by the dimensions of the subspaces. In particular, the q-analog of a constant... |

17 |
Partitioning the planes of AG2m(2) into 2-designs.
- Baker
- 1976
(Show Context)
Citation Context ...q) are known for many years. For q = 2 and odd n there is an 1parallelism in PG(n, 2). Such a parallelism was found in the context of Preparata codes and it is known that many such parallelisms exist =-=[6, 7, 119]-=-. For any other power of a prime q, if n = 2i − 1, i ≥ 2, then an 1-parallelism was shown in [8]. In the last forty years no new parameters for 1-parallelisms were shown until recently, when an 1-para... |

17 |
On parallelisms in finite projective spaces.
- Beutelspacher
- 1974
(Show Context)
Citation Context ...m was found in the context of Preparata codes and it is known that many such parallelisms exist [6, 7, 119]. For any other power of a prime q, if n = 2i − 1, i ≥ 2, then an 1-parallelism was shown in =-=[8]-=-. In the last forty years no new parameters for 1-parallelisms were shown until recently, when an 1-parallelism in PG(5,3) was proved to exist in [51]. A k-parallelism for k > 1 was not known until a ... |

13 |
A general class of maximal codes for computer applications,
- Hong, Patel
- 1972
(Show Context)
Citation Context ...vides n is a Steiner structure Sq(1, k, n). The value of Aq(n, k, k) is of a very special interest. This value has a special interest since (n, k, k)q codes have applications as byte-correcting codes =-=[43, 65]-=-. Decoding of such constant dimension codes was considered in [58, 77] The known upper and lower bounds on Aq(n, k, k) are summarized in the following theorems. The first three well-known theorems can... |

12 | Greedy and heuristic algorithms for codes and colorings
- Etzion, ¨Ostergård
- 1998
(Show Context)
Citation Context ...her measure of distance, called the injection distance given by dI(X, Y ) = max{dim(X), dim(Y )} − dim(X ∩ Y ) . The injection distance is the q-analog of the asymmetric distance between binary words =-=[42, 47, 94]-=-. Both, the subspace distance and the injection distance are metrics. When X and Y have the same dimension k, the subspace metric and the injection metric coincide. If X, Y ∈ Gq(n, k) then we can defi... |

12 | Packing and covering properties of subspace codes for error control in random linear network coding,”
- Gadouleau, Yan
- 2010
(Show Context)
Citation Context .... This will be further demonstrated and explained at the end of this section. Also, as in the case of the subspace distance, classic lower bounds such as the Gilbert-Varshamov bound were developed in =-=[55, 68]-=-. As for upper bounds, a linear programming was developed in [3], and in [5] there is a modification of the linear programming given in [50]. A semidefinite programming bound was also given in [5] and... |

12 |
Algebraic list-decoding on the operator channel
- Mahdavifar, Vardy
- 2010
(Show Context)
Citation Context ...ance or the injection distance. Quite naturally also list-decoding algorithms were developed for Grassmannian codes (constructed either by linearlized polynomials or as lifted rank-metric codes), e.g =-=[2, 59, 60, 73, 74, 75, 76, 85, 111]-=-. Also, this direction of research has many problems for future research. Research problem 56. Suggest new classes of large Grassmannian codes, subspace codes (with the subspace distance or the inject... |

11 | On the dimension of the hull
- Sendrier
- 1997
(Show Context)
Citation Context ... that the largest subset of Pq(n) on which a complement can be defined is the set Vq(n) = {X ∈ Pq(n) : X ∩X⊥ = {0}}; or disprove this claim. A closed-form expression for |Vq(n)| was given by Sendrier =-=[103]-=-. Using the results of [103], it can be shown that the size of Vq(n) is proportional to |Pq(n)|, specifically: lim n→∞ |Vq(n)| |Pq(n)| = ∞∏ i=1 1 1 + q−i . The limit converge to 0.4194 . . . when q = ... |

10 | Shadows and Intersections in Vector Spaces
- Chowdhury, Patkós
(Show Context)
Citation Context ...pace. q-analogs of various combinatorial objects are well known [115, pp. 325-332]. Of special interest are q-analogs in extremal combinatoric as well as other well-known combinatorial problems, e.g. =-=[14, 15, 28, 29, 53, 66]-=-. The related techniques and results might be of usage in coding theory. It turns out that the natural measure of distance in Pq(n) is given by dS(X, Y ) def = dimX + dimY − 2 dim ( X ∩Y ) , for all X... |

10 |
New lower bounds for asymmetric and unidirectional codes
- Etzion
- 1991
(Show Context)
Citation Context ...her measure of distance, called the injection distance given by dI(X, Y ) = max{dim(X), dim(Y )} − dim(X ∩ Y ) . The injection distance is the q-analog of the asymmetric distance between binary words =-=[42, 47, 94]-=-. Both, the subspace distance and the injection distance are metrics. When X and Y have the same dimension k, the subspace metric and the injection metric coincide. If X, Y ∈ Gq(n, k) then we can defi... |

10 | Perfect byte-correcting codes
- Etzion
- 1998
(Show Context)
Citation Context ...vides n is a Steiner structure Sq(1, k, n). The value of Aq(n, k, k) is of a very special interest. This value has a special interest since (n, k, k)q codes have applications as byte-correcting codes =-=[43, 65]-=-. Decoding of such constant dimension codes was considered in [58, 77] The known upper and lower bounds on Aq(n, k, k) are summarized in the following theorems. The first three well-known theorems can... |

9 | Bounds for projective codes from semidefinite programming
- Bachoc, Vallentin, et al.
- 2013
(Show Context)
Citation Context ...lassic linear programming does not yield any improvements, when applied for bounds on codes in Gq(n, k) or in Pq(n). A somehow stronger method is the semidefinite programming [90, 91] as suggested in =-=[5]-=- for the projective space. This method and the one in [50] yield all the best known upper bounds on ASq (n, d), when in most cases the semidefinite programming yields better bounds. The following list... |

9 |
Locally symmetric designs
- Cameron
- 1974
(Show Context)
Citation Context ...ement of S. Steiner systems were subject to an extensive research in combinatorial designs [33]. A Steiner system is also equivalent to an optimal constant weight codes in the Hamming scheme. Cameron =-=[25, 26]-=- and Delsarte [37] have extended the notions of block design and Steiner systems to vector spaces. A Steiner structure (q-Steiner system) Sq(t, k, n) is a collection S of elements from Gq(n, k) (calle... |

9 |
A.: List-decoding of subspace codes and rank-metric codes up to singleton bound
- Mahdavifar, Vardy
- 2012
(Show Context)
Citation Context ...ance or the injection distance. Quite naturally also list-decoding algorithms were developed for Grassmannian codes (constructed either by linearlized polynomials or as lifted rank-metric codes), e.g =-=[2, 59, 60, 73, 74, 75, 76, 85, 111]-=-. Also, this direction of research has many problems for future research. Research problem 56. Suggest new classes of large Grassmannian codes, subspace codes (with the subspace distance or the inject... |

9 |
Anticodes for the Grassmann and bilinear forms graphs
- Martin, Zhu
- 1995
(Show Context)
Citation Context ...his application, since Grassmannian codes are q-analogs of the well studied constant weight codes [23]. For example, the nonexistence of nontrivial perfect codes in the Grassmann scheme was proved in =-=[27, 79]-=-. The well-known concept of q-analogs replaces subsets by subspaces of a vector space over a finite field and their orders by the dimensions of the subspaces. In particular, the q-analog of a constant... |

8 |
Partial t-spreads and group constructible (s, r, µ)-nets,
- Drake, Freeman
- 1979
(Show Context)
Citation Context ...1 was extended for the case where q = 2 and k = 3 in [41] as follows. Theorem 12. If n ≡ c (mod 3) then A2(n, 3, 3) = 2n−2c 7 − c. The upper bound implied by Theorem 11 was improved for some cases in =-=[39]-=- in which a transformation, of partial spreads into orthogonal arrays of strength two, is considered. Theorem 13. If n = kℓ + c with 0 < c < k, then Aq(n, k, k) ≤ ∑ℓ−1 i=0 q ik+c − Ω − 1, where 2Ω = √... |

8 |
Codes and Designs Related to Lifted MRD
- Etzion, Silberstein
(Show Context)
Citation Context ...ivated other research work to explore this topic and more t-designs over Fq were found [20, 67, 84, 104, 105, 107]. Another type of design over Fq which was defined is the subspace transversal design =-=[49]-=-. It is not a direct q-analog of a transversal design as will be explained in the sequel. Let V(n,k) be the set of nonzero vectors of Fnq whose first k entries form a nonzero vector. For a given X ∈ G... |

7 |
Generalisation of Fisher’s inequality to fields with more than one element, in T.P.McDonough and V.C.Mavron
- Cameron
- 1974
(Show Context)
Citation Context ...ement of S. Steiner systems were subject to an extensive research in combinatorial designs [33]. A Steiner system is also equivalent to an optimal constant weight codes in the Hamming scheme. Cameron =-=[25, 26]-=- and Delsarte [37] have extended the notions of block design and Steiner systems to vector spaces. A Steiner structure (q-Steiner system) Sq(t, k, n) is a collection S of elements from Gq(n, k) (calle... |

7 |
On q-Analogs for Steiner Systems and Covering
- Etzion, Vardy
(Show Context)
Citation Context ...i) exists. Corollary 1. If a Steiner structure Sq(t, k, n) exists then for all 0 ≤ i ≤ t− 1. [ n−i t−i ] q[ k−i t−i ] q must be integers. Steiner structures and Steiner systems are highly related. In =-=[52, 93]-=- there are some constructions of Steiner systems derived from Steiner structures. Further research on Steiner structures seems to be fascinating, but also extremely difficult. We list some interesting... |

7 | Subspace codes
- Khaleghi, Silva, et al.
- 2009
(Show Context)
Citation Context ...ding is trivial by using the encoding of the related rank-metric code. If the code is constructed by the Multilevel Construction then the encoding is slightly more complicated and it was described in =-=[69]-=-. Finally, encoding of all the Grassmannian space was described in [80, 95]. Research problem 60. Find better encoding algorithms for subspace codes, the Grassmannian Gq(n, k), or the projective space... |

7 |
Bose-Burton type theorems for finite projective, Affine and Polar spaces
- Metsch
- 1999
(Show Context)
Citation Context ...exist if and only if k divides n. These are called spreads and they will be discussed in the next section. Thomas [107] showed that certain kind of Steiner structures S2(2, 3, 7) cannot exist. Metsch =-=[81]-=- conjectured that nontrivial Steiner structures with t ≥ 2 do not exist. Steiner structures appear also in connection of diameter perfect codes in the Grassmann scheme. It was proved in [4] that the o... |

7 | Enumerative coding for Grassmannian space.
- Silberstein, Etzion
- 2011
(Show Context)
Citation Context ...If the code is constructed by the Multilevel Construction then the encoding is slightly more complicated and it was described in [69]. Finally, encoding of all the Grassmannian space was described in =-=[80, 95]-=-. Research problem 60. Find better encoding algorithms for subspace codes, the Grassmannian Gq(n, k), or the projective space Pq(n). 10 Designs over GF(q) q-analog of Steiner systems are one type of q... |

6 |
A characteristic property of geometric tspreads in finite projective spaces
- Beutelspacher, Ueberberg
- 1991
(Show Context)
Citation Context ...ven by construction, on the size of a q-covering design was proved in [52]. Theorem 25. Cq(n, k, r) ≤ qn−kCq(n− 1, k − 1, r − 1) + Cq(n− 1, k, r). Normal spreads [72], also known as geometric spreads =-=[12]-=-, are used to prove the following values of Cq(n, k, r) [13]. Theorem 26. Cq(vm+ δ, vm−m+ δ, v − 1) = qvm−1 qm−1 for all v ≥ 2, m ≥ 2, and δ ≥ 0. The next theorem given in [52] is used infinitely many... |

6 | Colouring lines in projective spaces
- Chowdhury, Godsil, et al.
(Show Context)
Citation Context ...pace. q-analogs of various combinatorial objects are well known [115, pp. 325-332]. Of special interest are q-analogs in extremal combinatoric as well as other well-known combinatorial problems, e.g. =-=[14, 15, 28, 29, 53, 66]-=-. The related techniques and results might be of usage in coding theory. It turns out that the natural measure of distance in Pq(n) is given by dS(X, Y ) def = dimX + dimY − 2 dim ( X ∩Y ) , for all X... |

6 | Covering by complements of subspaces
- Clark, Shekhtman
- 1997
(Show Context)
Citation Context ...y codes are used as a tool in various aspects of coding theory. The q-analog was considered in [19]. Various related problems concerning complements of subspaces over Fq were considered before, e. g. =-=[30, 31, 32]-=-. Definition 1. Let U be a subset of Pq(n) and let Uk := U ∩Gq(n, k). We say that a function f : U → U is a complement on U (and denote X = f(X) for all X ∈ U) if f has the following properties: P1. X... |

6 |
On conjugacy classes of subgroups of the general linear group and cyclic orbit codes
- Manganiello, Trautmann, et al.
- 1916
(Show Context)
Citation Context ... mainly since the value of Aq(n, δ, 2) is known for all parameters. Another family of codes which was considered, even so the codes were not as large as in previous constructions, are the orbit codes =-=[78, 109, 110, 114]-=-. This family of codes might deserve further attention in the future. Another line of research for Grassmannain codes is based on Schubert calculus and Plücker coordinates. These were considered for ... |

6 | Large constant dimension codes and lexicodes
- Silberstein, Etzion
(Show Context)
Citation Context ...ker coordinates. These were considered for example in [57, 111, 113] and their further research might lead to new interesting results. Lexicodes in the Grassmannian and their search were discussed in =-=[96]-=-. Codes which are able to correct also errors in coordinates (such as deletion or localized errors) are considered in [24, 101]. A question on the size of equidistant Grassmannian codes was asked in [... |

5 |
On a class of small 2-designs over GF(q
- Miyakawa, Munemasa, et al.
- 1995
(Show Context)
Citation Context ...Thomas [106] was the first to find nontrivial t-design over Fq, which are not spreads. The work of Thomas has motivated other research work to explore this topic and more t-designs over Fq were found =-=[20, 67, 84, 104, 105, 107]-=-. Another type of design over Fq which was defined is the subspace transversal design [49]. It is not a direct q-analog of a transversal design as will be explained in the sequel. Let V(n,k) be the se... |

5 |
2-designs over GF(2m
- Suzuki
- 1990
(Show Context)
Citation Context ...Thomas [106] was the first to find nontrivial t-design over Fq, which are not spreads. The work of Thomas has motivated other research work to explore this topic and more t-designs over Fq were found =-=[20, 67, 84, 104, 105, 107]-=-. Another type of design over Fq which was defined is the subspace transversal design [49]. It is not a direct q-analog of a transversal design as will be explained in the sequel. Let V(n,k) be the se... |

4 |
Systematic construction of q-analogs of t
- Braun, Kerber, et al.
(Show Context)
Citation Context ...Thomas [106] was the first to find nontrivial t-design over Fq, which are not spreads. The work of Thomas has motivated other research work to explore this topic and more t-designs over Fq were found =-=[20, 67, 84, 104, 105, 107]-=-. Another type of design over Fq which was defined is the subspace transversal design [49]. It is not a direct q-analog of a transversal design as will be explained in the sequel. Let V(n,k) be the se... |

4 | Matching subspaces with complements in finite vector spaces
- Clark
- 1992
(Show Context)
Citation Context ...y codes are used as a tool in various aspects of coding theory. The q-analog was considered in [19]. Various related problems concerning complements of subspaces over Fq were considered before, e. g. =-=[30, 31, 32]-=-. Definition 1. Let U be a subset of Pq(n) and let Uk := U ∩Gq(n, k). We say that a function f : U → U is a complement on U (and denote X = f(X) for all X ∈ U) if f has the following properties: P1. X... |

4 |
A new family of 2-designs over GF(q) admitting SLm(q ℓ), Geometriae Dedicata
- Itoh
- 1998
(Show Context)
Citation Context |

4 |
Normal Spreads, Geometriae Dedicata
- Lunardon
- 1999
(Show Context)
Citation Context ...n [82]. The most basic upper bound, given by construction, on the size of a q-covering design was proved in [52]. Theorem 25. Cq(n, k, r) ≤ qn−kCq(n− 1, k − 1, r − 1) + Cq(n− 1, k, r). Normal spreads =-=[72]-=-, also known as geometric spreads [12], are used to prove the following values of Cq(n, k, r) [13]. Theorem 26. Cq(vm+ δ, vm−m+ δ, v − 1) = qvm−1 qm−1 for all v ≥ 2, m ≥ 2, and δ ≥ 0. The next theorem... |

4 |
Blocking sets in projective spaces and polar spaces
- Metsch
(Show Context)
Citation Context ...s a q-analog of the well-known Turán design [34, 35]. The dual subspaces of the subspaces in a blocking set form a q-covering design Cq(n+1, n− t, n− s). Blocking sets were considered for example in =-=[82, 83]-=-. We note that blocking sets have also some different definitions (and maybe more popular definitions which define other structures which are not q-coverings). Similarly, to the case of error-correcti... |

4 |
Decoding of subspace codes, a problem of schubert calculus over finite fields, arXiv:1209.2887 [cs.IT
- Rosenthal, Trautmann
- 2012
(Show Context)
Citation Context |

4 |
On point-cyclic resolutions of the 2
- Sarmiento
(Show Context)
Citation Context ...ters for 1-parallelisms were shown until recently, when an 1-parallelism in PG(5,3) was proved to exist in [51]. A k-parallelism for k > 1 was not known until a 2-parallelism in PG(5, 2) was shown in =-=[87]-=-. Clearly, such parallelisms can be described in terms of spreads in the Grassmannian. As it seems to be extremely difficult, we consider two problems which are generalizations of the parallelism prob... |

4 |
New lower bounds of the size of error-correcting codes for the Z-channel
- Shilo
- 2002
(Show Context)
Citation Context ...her measure of distance, called the injection distance given by dI(X, Y ) = max{dim(X), dim(Y )} − dim(X ∩ Y ) . The injection distance is the q-analog of the asymmetric distance between binary words =-=[42, 47, 94]-=-. Both, the subspace distance and the injection distance are metrics. When X and Y have the same dimension k, the subspace metric and the injection metric coincide. If X, Y ∈ Gq(n, k) then we can defi... |

4 |
2-designs over GF(q
- Suzuki
- 1992
(Show Context)
Citation Context |

3 | On error control codes for random network coding
- Ahlswede, Aydinian
(Show Context)
Citation Context ...section. Also, as in the case of the subspace distance, classic lower bounds such as the Gilbert-Varshamov bound were developed in [55, 68]. As for upper bounds, a linear programming was developed in =-=[3]-=-, and in [5] there is a modification of the linear programming given in [50]. A semidefinite programming bound was also given in [5] and it was shown that the bounds obtained are very similar to those... |

3 |
The Asymptotic Behavior of Grassmannian Codes
- Blackburn, Etzion
(Show Context)
Citation Context ...proved in [52]. Theorem 25. Cq(n, k, r) ≤ qn−kCq(n− 1, k − 1, r − 1) + Cq(n− 1, k, r). Normal spreads [72], also known as geometric spreads [12], are used to prove the following values of Cq(n, k, r) =-=[13]-=-. Theorem 26. Cq(vm+ δ, vm−m+ δ, v − 1) = qvm−1 qm−1 for all v ≥ 2, m ≥ 2, and δ ≥ 0. The next theorem given in [52] is used infinitely many times once an exact bound for some given parameters is know... |

3 |
On lattices, binary codes and network codes
- Braun
(Show Context)
Citation Context ...ll X ∈ U . P4. dS(X, Y ) = dS(X, Y ) for all X, Y ∈ U . The existence problems of complements in Pq(n) was considered in [19]. Some of the results are based on representation of subspaces by lattices =-=[17]-=-. The main open problem which remains unsolved in this discussion is our next open problem. Research problem 98. Prove that the largest subset of Pq(n) on which a complement can be defined is the set ... |

3 |
q-analogs of packing designs
- Braun, Reichelt
(Show Context)
Citation Context ...morphisms of constant dimension codes were studied in [108]. Constructions for small dimensions might be attractive in this context. Interesting codes admitting some automorphisms were constructed in =-=[22]-=-. Some of these codes have an interesting combinatorial structure and some were found only by computer search. These were used to obtain lower bounds on A2(n, 2, 3). Lower bounds on Aq(n, 2, 3) were a... |

3 |
Extension of a theorem of Moon and
- Caen
- 1983
(Show Context)
Citation Context ...tive geometry. A set T of t-subspaces in PG(n, q) such that each s-subspace contains at least one element of T is called 22 a blocking set. Such a design is a q-analog of the well-known Turán design =-=[34, 35]-=-. The dual subspaces of the subspaces in a blocking set form a q-covering design Cq(n+1, n− t, n− s). Blocking sets were considered for example in [82, 83]. We note that blocking sets have also some d... |

3 |
Automorphisms of codes in the Grassmann Scheme. arXiv preprint
- Etzion, Vardy
- 1210
(Show Context)
Citation Context ... 2i − 1, i ≥ 2, then an 1-parallelism was shown in [8]. In the last forty years no new parameters for 1-parallelisms were shown until recently, when an 1-parallelism in PG(5,3) was proved to exist in =-=[51]-=-. A k-parallelism for k > 1 was not known until a 2-parallelism in PG(5, 2) was shown in [87]. Clearly, such parallelisms can be described in terms of spreads in the Grassmannian. As it seems to be ex... |

3 | List decoding subspace codes from insertions and deletions
- Guruswami, Narayanan, et al.
- 2012
(Show Context)
Citation Context |

3 | New lower bounds for constant dimension codes
- Silberstein, Trautmann
- 2013
(Show Context)
Citation Context ...t two sections. A comprehensive description and discussion on the Multilevel Construction can be found in [48]. Some improvements which enable to add more codewords for the final code can be found in =-=[97, 112]-=-. Research problem 13. Find a method which combine the Multilevel Construction with more concepts to obtain larger codes. Research problem 14. What is the best way to choose a skeleton code for the Mu... |

2 |
On the chromatic number of qKneser graphs
- Blokhuis, Brouwer, et al.
(Show Context)
Citation Context |

2 |
On q-analogues and stability theorems
- Weiner
(Show Context)
Citation Context |

2 |
Blocking s-dimensional subspaces by lines
- Eisfeld, Metsch
- 1997
(Show Context)
Citation Context ...k−1 ⌉ . Theorem 22. If 1 ≤ r ≤ n− 1, then Cq(n, n− 1, r) = qr+1−1 q−1 . Theorem 22 was proved before in the context of projective geometry by Bose and Burton in [16]. Another lower bound was given in =-=[40]-=- by considering sets of lines in PG(2s, q) contained in s-subspaces. Theorem 23. Cq(2s+ 1, 2s− 1, s) ≥ q2s+2−q2 q2−1 + q s+1−1 q−1 for every integer s ≥ 2. Metsch [82] also gave a construction for a s... |

2 |
The maximum size of a maximal 3-spread in a finite vector space over
- El-Zanati, Jordon, et al.
(Show Context)
Citation Context ...1c a21a Bounds on A2(7, δ, k) δ k3 2 3 d17d 2 e329− 381f g31h 6 Bounds on A2(8, δ, k) δ k4 3 2 4 a17a 3 i257− 289j d34d 2 k4797− 6477f e1312− 1493c a85a • a - Theorem 8. • b - [71]. • c - [50]. • d - =-=[41]-=-. • e - [22]. • f - Theorem 2. • g - Theorem 10. • h - Theorem 9. • i - The Multilevel Construction with CMRD. • j - Theorem 1. • k - [49]. Some of the specific values of Aq(n, δ, k) can be of special... |

2 |
Projective space codes for injection metric, arxiv.org/abs/0904.0813
- Khaleghi, Kschischang
- 2009
(Show Context)
Citation Context ...e subspace distance, from a practical point of view [99]. Let AIq(n, d) denote the maximum number of codewords in an (n, d) I q code. The injection distance is the q-analog of the asymmetric distance =-=[68]-=-. Also, the related graph G(PIq (n)) is not distance regular which makes the analysis of some bounds more difficult as in the case of the subspace distance and the related graph G(PSq (n)). Similarly ... |

2 | Hybrid noncoherent network coding
- Skachek, Milenkovic, et al.
(Show Context)
Citation Context ...ing results. Lexicodes in the Grassmannian and their search were discussed in [96]. Codes which are able to correct also errors in coordinates (such as deletion or localized errors) are considered in =-=[24, 101]-=-. A question on the size of equidistant Grassmannian codes was asked in [50]. In an equidistant code, any two codewords have the same distance, which is clearly the minimum distance of the code. This ... |

1 |
Combinatorial lower bound for list decoding of codes on finite field Grassmannian
- Agarwal
(Show Context)
Citation Context |

1 |
Existence of q-Analogs of Steiner Systems, arxiv.org/abs/1304.1462
- Braun, Etzion, et al.
- 2013
(Show Context)
Citation Context ... in Fqn. Cyclic codes have a nice automorphism group. But, there are other automorphisms which can be forced on the code. One example is the use of the Frobenius mapping which was used for example in =-=[18]-=-. Some automorphisms of constant dimension codes were studied in [108]. Constructions for small dimensions might be attractive in this context. Interesting codes admitting some automorphisms were cons... |

1 |
Linearity and Complements
- Braun, Etzion, et al.
- 2013
(Show Context)
Citation Context ... making use of necklaces in the Hamming graph. 14.2 Complements Complements of binary codewords and binary codes are used as a tool in various aspects of coding theory. The q-analog was considered in =-=[19]-=-. Various related problems concerning complements of subspaces over Fq were considered before, e. g. [30, 31, 32]. Definition 1. Let U be a subset of Pq(n) and let Uk := U ∩Gq(n, k). We say that a fun... |

1 |
Large Sets of t-Designs over Finite Fields, arxiv.org/abs/1305.1455
- Braun, Kohnert, et al.
- 2013
(Show Context)
Citation Context ...into disjoint copies of t− (n, k, λ)q designs. Parallelism in projective geometry is a large set and this topic will be discussed separately in Section 13. Braun, Kohnert, Österg̊ard, and Wassermann =-=[21]-=- presented a large set of 2 − (8, 3, 21)2 designs. This large set consists of three disjoint 2− (8, 3, 21)2 designs. Research problem 65. Find more large sets of t− (n, k, λ)q designs. 11 q-Covering D... |

1 |
A new table of constant weight codes
- Cai
(Show Context)
Citation Context ...ing results. Lexicodes in the Grassmannian and their search were discussed in [96]. Codes which are able to correct also errors in coordinates (such as deletion or localized errors) are considered in =-=[24, 101]-=-. A question on the size of equidistant Grassmannian codes was asked in [50]. In an equidistant code, any two codewords have the same distance, which is clearly the minimum distance of the code. This ... |

1 |
Etzion Covering of subspaces by subspaces, arxiv.org/abs/1111.4319
- unknown authors
- 2011
(Show Context)
Citation Context ...in [49] how to use the properties of subspace transversal design to obtain better bounds on Aq(n, δ, k) with codes which contains CMRD. These properties were also used to construct q-covering designs =-=[44]-=- and parallelisms [45] and they probably can be used for constructions of other related structures. Research problem 61. Find new t− (n, k, λ)q designs with new parameters. Research problem 62. Find q... |

1 |
Etzion Partial k-Parallelisms
- unknown authors
- 2013
(Show Context)
Citation Context ... properties of subspace transversal design to obtain better bounds on Aq(n, δ, k) with codes which contains CMRD. These properties were also used to construct q-covering designs [44] and parallelisms =-=[45]-=- and they probably can be used for constructions of other related structures. Research problem 61. Find new t− (n, k, λ)q designs with new parameters. Research problem 62. Find q-analogs for other kno... |

1 |
Etzion The q-Analog of the Middle
- unknown authors
- 2013
(Show Context)
Citation Context ...all the (k + 1)-dimensional subspaces? Research problem 97. What is the length of the longest path in G(PSq (2k + 1)) which contains only k-dimensional subspaces and (k + 1)-dimensional subspaces? In =-=[46]-=- it is shown that for any given q and k = 1 or k = 2 there exists a Hamiltonian cycle in the middle levels of Pq(2k + 1). The method is using cyclic shifts of subspaces in a modification of a similar ... |

1 |
Subspace codes for random networks based on Plücker coordinates and Schubert cells, arxiv.org/abs/1301.6362
- Ghatak
- 2013
(Show Context)
Citation Context ...ly of codes might deserve further attention in the future. Another line of research for Grassmannain codes is based on Schubert calculus and Plücker coordinates. These were considered for example in =-=[57, 111, 113]-=- and their further research might lead to new interesting results. Lexicodes in the Grassmannian and their search were discussed in [96]. Codes which are able to correct also errors in coordinates (su... |

1 |
An Algebraic Approach for Decoding Spread
- Gorla, Manganiello, et al.
(Show Context)
Citation Context ...s of a very special interest. This value has a special interest since (n, k, k)q codes have applications as byte-correcting codes [43, 65]. Decoding of such constant dimension codes was considered in =-=[58, 77]-=- The known upper and lower bounds on Aq(n, k, k) are summarized in the following theorems. The first three well-known theorems can be found in [50]. Theorem 8. If k divides n then Aq(n, k, k) = qn−1 q... |

1 |
Bounds for equididtant codes and partial projective planes
- Hall
- 1977
(Show Context)
Citation Context ...[50]. In an equidistant code, any two codewords have the same distance, which is clearly the minimum distance of the code. This problem is highly connected to problems in extremal combinatorics, e.g. =-=[53, 61]-=-. Some work in this direction was done lately in [62, 63, 64]. Finally, there are other related coding problems in the Grassmannian. For example, the intersection size of balls around codewords has so... |

1 |
Equidistant linear codes with maximal error-protection from Veronese varieties, arxiv.org/abs/1207.2083
- Hansen
- 2012
(Show Context)
Citation Context ...same distance, which is clearly the minimum distance of the code. This problem is highly connected to problems in extremal combinatorics, e.g. [53, 61]. Some work in this direction was done lately in =-=[62, 63, 64]-=-. Finally, there are other related coding problems in the Grassmannian. For example, the intersection size of balls around codewords has some interesting applications [118], where the case for the int... |

1 |
Hansen Osculating spaces of varieties and linear network codes, arxiv.org/abs/1210.7961
- P
- 2012
(Show Context)
Citation Context ...same distance, which is clearly the minimum distance of the code. This problem is highly connected to problems in extremal combinatorics, e.g. [53, 61]. Some work in this direction was done lately in =-=[62, 63, 64]-=-. Finally, there are other related coding problems in the Grassmannian. For example, the intersection size of balls around codewords has some interesting applications [118], where the case for the int... |

1 |
Hansen Forms and linear network codes, arxiv.org/abs/1303.1626
- P
- 2013
(Show Context)
Citation Context ...same distance, which is clearly the minimum distance of the code. This problem is highly connected to problems in extremal combinatorics, e.g. [53, 61]. Some work in this direction was done lately in =-=[62, 63, 64]-=-. Finally, there are other related coding problems in the Grassmannian. For example, the intersection size of balls around codewords has some interesting applications [118], where the case for the int... |

1 |
Algebraic list-decoding of subspace codes with multiplicities
- Mahdavifar, Vardy
- 2011
(Show Context)
Citation Context |

1 |
Algebraic list-decoding of subspace codes, arxiv.org/abs/1202.0338, Ffebruary 2012
- Mahdavifar, Vardy
(Show Context)
Citation Context |

1 |
Fast enumeration for Grassmannian space, in proc
- Medvedeva
(Show Context)
Citation Context ...If the code is constructed by the Multilevel Construction then the encoding is slightly more complicated and it was described in [69]. Finally, encoding of all the Grassmannian space was described in =-=[80, 95]-=-. Research problem 60. Find better encoding algorithms for subspace codes, the Grassmannian Gq(n, k), or the projective space Pq(n). 10 Designs over GF(q) q-analog of Steiner systems are one type of q... |

1 |
Blocking subspaces by lines in PG(n, q
- Metsch
(Show Context)
Citation Context ...s a q-analog of the well-known Turán design [34, 35]. The dual subspaces of the subspaces in a blocking set form a q-covering design Cq(n+1, n− t, n− s). Blocking sets were considered for example in =-=[82, 83]-=-. We note that blocking sets have also some different definitions (and maybe more popular definitions which define other structures which are not q-coverings). Similarly, to the case of error-correcti... |