Error-Correcting Codes in Projective Space
From MaRDI portal
Publication:5281105
DOI10.1109/TIT.2010.2095232zbMATH Open1366.94589OpenAlexW2095418648MaRDI QIDQ5281105FDOQ5281105
Authors: Tuvi Etzion, Alexander Vardy 
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2010.2095232
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Bounds on codes (94B65) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cited In (99)
- Perfect codes in the discrete simplex
- Linearized trinomials with maximum kernel
- Partial spreads in random network coding
- Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring
- 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
- Nontrivial \(t\)-designs over finite fields exist for all \(t\)
- Optimal Ferrers diagram rank-metric codes from MRD codes
- Error-correcting codes on low rank surfaces
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- q-Analogs of Packing Designs
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- A characterization of cyclic subspace codes via subspace polynomials
- On the extendability of particular classes of constant dimension codes
- Construction of optimal constant-dimension subspace codes
- New constructions of constant dimension codes by improved inserting construction
- A family of linear codes from constant dimension subspace codes
- Abelian non-cyclic orbit codes and multishot subspace codes
- Cyclic orbit flag codes
- Deterministic construction of compressed sensing matrices from constant dimension codes
- New constant dimension subspace codes from block inserting constructions
- Book spreads in \(\mathrm{PG}(7,2)\)
- 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
- The maximum size of a partial spread in a finite projective space
- New constructions of orbit codes based on the operations of orbit codes
- Projective spaces and quasi-cyclic codes
- Title not available (Why is that?)
- Several classes of optimal Ferrers diagram rank-metric codes
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
- LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
- Cyclic subspace codes via subspace polynomials
- Rank-Metric Codes and Their Applications
- Construction of subspace codes through linkage
- Constructions and bounds for mixed-dimension subspace codes
- Further constructions of cyclic subspace codes
- New and updated semidefinite programming bounds for subspace codes
- A note on equidistant subspace codes
- Almost affinely disjoint subspaces and covering Grassmannian codes
- Linearity and complements in projective space
- Galois geometries and coding theory
- Subspace codes from Ferrers diagrams
- Error-correcting codes in attenuated space over finite fields
- A new approach for examining \(q\)-Steiner systems
- Several kinds of large cyclic subspace codes via Sidon spaces
- Orbit codes from forms on vector spaces over a finite field
- Automorphism groups and isometries for cyclic orbit codes
- Constant dimension codes from Riemann-Roch spaces
- Title not available (Why is that?)
- Multi-orbit cyclic subspace codes and linear sets
- New Lower Bounds for Binary Constant-Dimension Subspace Codes
- Message encoding and retrieval for spread and cyclic orbit codes
- Cores and independence numbers of Grassmann graphs
- Equidistant codes in the Grassmannian
- Error-correcting codes based on partial linear maps of finite-dimensional vector spaces
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius
- Subspace packings: constructions and bounds
- Johnson type bounds for mixed dimension subspace codes
- Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects
- Algebraic codes for network coding
- Cyclic orbit codes and stabilizer subfields
- Bounds on subspace codes based on totally isotropic subspaces in unitary spaces
- An asymptotically optimal construction of almost affinely disjoint subspaces
- Covering of subspaces by subspaces
- The maximum size of a partial spread. II: Upper bounds
- Comment on ``error rate performance of the projection code
- New constructions of Sidon spaces and large cyclic constant dimension codes
- Constructions and equivalence of Sidon spaces
- Title not available (Why is that?)
- New constant dimension subspace codes from multilevel linkage construction
- Localized Error Correction in Projective Space
- Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
- Bounds on subspace codes based on subspaces of type \((s,0,0,0)\) in pseudo-symplectic spaces and singular pseudo-symplectic spaces
- Bilateral multilevel construction of constant dimension codes
- Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space
- Constructions of rank metric codes under actions of the unitary groups
- New constructions of Sidon spaces
- Constructions of Sidon spaces and cyclic subspace codes
- New lower bounds for partial k‐parallelisms
- Title not available (Why is that?)
- Distance distributions of cyclic orbit codes
- New constructions of large cyclic subspace codes and Sidon spaces
- Two new constructions of cyclic subspace codes via Sidon spaces
- The interplay of different metrics for the construction of constant dimension codes
- On generalized Sidon spaces
- A Note on Optimal Constant Dimension Codes
- Error correcting codes and spatial coupling
- Subspace code based on flats in affine space over finite fields
- Constructions of large cyclic constant dimension codes via Sidon spaces
- Further constructions of large cyclic subspace codes via Sidon spaces
- New constructions of constant dimension subspace codes with large sizes
- Automorphisms of Grassmann graphs over a residue class ring
- Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2
- Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups
- Large optimal cyclic subspace codes
- Cyclic constant dimension subspace codes via the sum of Sidon spaces
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)
