On the extendability of particular classes of constant dimension codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5129494 (Why is no real title available?)
- scientific article; zbMATH DE number 1342088 (Why is no real title available?)
- scientific article; zbMATH DE number 1117678 (Why is no real title available?)
- scientific article; zbMATH DE number 3999824 (Why is no real title available?)
- scientific article; zbMATH DE number 3257050 (Why is no real title available?)
- A Random Linear Network Coding Approach to Multicast
- Baer subplanes and blocking sets
- Coding for Errors and Erasures in Random Network Coding
- Designs and partial geometries over finite fields
- Designs over finite fields
- Error-Correcting Codes in Projective Space
- Existence of \(q\)-analogs of Steiner systems
- Intersection numbers for subspace designs
- Lacunary Polynomials, Multiple Blocking Sets and Baer Subplanes
- Network information flow
- On \(q\)-analogs of Steiner systems and covering designs
- On a class of small 2‐designs over gf(q)
- On a geometrical method of construction of maximal t-linearly independent sets
- On a particular class of minihypers and its applications. I: The result for general \(q\)
- On t-covers in finite projective spaces
- On the automorphism group of a binary \(q\)-analog of the Fano plane
- On the existence of a \((2,3)\)-spread in \(V(7,2)\).
- On the size of a blocking set in \(\text{PG}(2,p)\)
- Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
Cited in
(2)
This page was built for publication: On the extendability of particular classes of constant dimension codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281294)
