Error-Correcting Codes in Projective Space
From MaRDI portal
Publication:5281105
Cited in
(99)- Optimal binary linear locally repairable codes with disjoint repair groups
- Bounds on subspace codes based on orthogonal space over finite fields of characteristic 2
- Comment on ``error rate performance of the projection code
- Constructions of Sidon spaces and cyclic subspace codes
- Distance distributions of cyclic orbit codes
- New constructions of large cyclic subspace codes and Sidon spaces
- New lower bounds for partial k‐parallelisms
- scientific article; zbMATH DE number 7124291 (Why is no real title available?)
- Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
- The interplay of different metrics for the construction of constant dimension codes
- New constructions of constant dimension subspace codes with large sizes
- Subspace code based on flats in affine space over finite fields
- New constant dimension subspace codes from multilevel linkage construction
- Isotropic constant dimension subspace codes
- Constructions of rank metric codes under actions of the unitary groups
- New constructions of Sidon spaces
- Automorphisms of Grassmann graphs over a residue class ring
- Large optimal cyclic subspace codes
- Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space
- Constructions of large cyclic constant dimension codes via Sidon spaces
- Further constructions of large cyclic subspace codes via Sidon spaces
- Localized Error Correction in Projective Space
- Cyclic constant dimension subspace codes via the sum of Sidon spaces
- On generalized Sidon spaces
- Bounds on subspace codes based on subspaces of type \((s,0,0,0)\) in pseudo-symplectic spaces and singular pseudo-symplectic spaces
- New constructions of Sidon spaces and large cyclic constant dimension codes
- Bilateral multilevel construction of constant dimension codes
- Constructions and equivalence of Sidon spaces
- Error correcting codes and spatial coupling
- Two new constructions of cyclic subspace codes via Sidon spaces
- A note on optimal constant dimension codes
- A new approach for examining \(q\)-Steiner systems
- Cyclic orbit flag codes
- Partial spreads in random network coding
- A characterization of cyclic subspace codes via subspace polynomials
- Randomized decoding of Gabidulin codes beyond the unique decoding radius
- Bounds on subspace codes based on totally isotropic subspaces in unitary spaces
- Several classes of optimal Ferrers diagram rank-metric codes
- Error-correcting codes on low rank surfaces
- Further constructions of cyclic subspace codes
- Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring
- Constant dimension codes from Riemann-Roch spaces
- Several kinds of large cyclic subspace codes via Sidon spaces
- Message encoding and retrieval for spread and cyclic orbit codes
- Cores and independence numbers of Grassmann graphs
- LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
- Orbit codes from forms on vector spaces over a finite field
- On the extendability of particular classes of constant dimension codes
- Construction of optimal constant-dimension subspace codes
- Algebraic codes for network coding
- A new construction of anticode-optimal Grassmannian codes
- Cyclic subspace codes via subspace polynomials
- Automorphism groups and isometries for cyclic orbit codes
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Almost affinely disjoint subspaces and covering Grassmannian codes
- An asymptotically optimal construction of almost affinely disjoint subspaces
- Nontrivial \(t\)-designs over finite fields exist for all \(t\)
- Optimal Ferrers diagram rank-metric codes from MRD codes
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
- Perfect codes in the discrete simplex
- Error-correcting codes based on partial linear maps of finite-dimensional vector spaces
- A family of linear codes from constant dimension subspace codes
- Subspace packings: constructions and bounds
- Johnson type bounds for mixed dimension subspace codes
- New constructions of constant dimension codes by improved inserting construction
- New constructions of orbit codes based on the operations of orbit codes
- New lower bounds for binary constant-dimension subspace codes
- Deterministic construction of compressed sensing matrices from constant dimension codes
- Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects
- A note on equidistant subspace codes
- Covering of subspaces by subspaces
- Rank-metric codes and their applications
- Linearized trinomials with maximum kernel
- New constant dimension subspace codes from block inserting constructions
- \(q\)-analogs of packing designs
- Projective spaces and quasi-cyclic codes
- Book spreads in \(\mathrm{PG}(7,2)\)
- Subspace codes from Ferrers diagrams
- Construction of subspace codes through linkage
- Constructions and bounds for mixed-dimension subspace codes
- Linearity and complements in projective space
- Multi-orbit cyclic subspace codes and linear sets
- The maximum size of a partial spread. II: Upper bounds
- Abelian non-cyclic orbit codes and multishot subspace codes
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- scientific article; zbMATH DE number 6902639 (Why is no real title available?)
- Existence of \(q\)-analogs of Steiner systems
- Equidistant codes in the Grassmannian
- The maximum size of a partial spread in a finite projective space
- Error-correcting codes in attenuated space over finite fields
- Flag codes: distance vectors and cardinality bounds
- Constructions of cyclic constant dimension codes
- Residual \(q\)-Fano planes and related structures
- Constructions of optimal Ferrers diagram rank metric codes
- New and updated semidefinite programming bounds for subspace codes
- Cyclic orbit codes and stabilizer subfields
- Galois geometries and coding theory
This page was built for publication: Error-Correcting Codes in Projective Space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281105)
