Error-Correcting Codes in Projective Space

DOI10.1109/TIT.2010.2095232zbMath1366.94589OpenAlexW2095418648MaRDI QIDQ5281105

Alexander Vardy, Tuvi Etzion

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

Mathematics Subject Classification ID

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)

Related Items (88)

Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases ⋮ On the extendability of particular classes of constant dimension codes ⋮ Construction of optimal constant-dimension subspace codes ⋮ Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius ⋮ New constant dimension subspace codes from block inserting constructions ⋮ New constant dimension subspace codes from parallel linkage construction and multilevel construction ⋮ Constructions of rank metric codes under actions of the unitary groups ⋮ New constructions of Sidon spaces ⋮ Constructions of Sidon spaces and cyclic subspace codes ⋮ Bounds on subspace codes based on totally isotropic subspaces in unitary spaces ⋮ Partial spreads in random network coding ⋮ Construction of subspace codes through linkage ⋮ Constructions and bounds for mixed-dimension subspace codes ⋮ q-Analogs of Packing Designs ⋮ Unnamed Item ⋮ Distance distributions of cyclic orbit codes ⋮ The maximum size of a partial spread in a finite projective space ⋮ New constructions of large cyclic subspace codes and Sidon spaces ⋮ Cyclic subspace codes via subspace polynomials ⋮ Unnamed Item ⋮ Linearity and complements in projective space ⋮ On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes ⋮ List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques ⋮ Constant dimension codes from multilevel construction based on matchings of complete hypergraphs ⋮ Almost affinely disjoint subspaces and covering Grassmannian codes ⋮ Optimal Ferrers diagram rank-metric codes from MRD codes ⋮ Constructions of large cyclic constant dimension codes via Sidon spaces ⋮ Nontrivial \(t\)-designs over finite fields exist for all \(t\) ⋮ A characterization of cyclic subspace codes via subspace polynomials ⋮ Constant dimension codes from Riemann-Roch spaces ⋮ Bilateral multilevel construction of constant dimension codes ⋮ Automorphism groups and isometries for cyclic orbit codes ⋮ The interplay of different metrics for the construction of constant dimension codes ⋮ Further constructions of large cyclic subspace codes via Sidon spaces ⋮ A note on equidistant subspace codes ⋮ Unnamed Item ⋮ Message encoding and retrieval for spread and cyclic orbit codes ⋮ Cores and independence numbers of Grassmann graphs ⋮ Deterministic construction of compressed sensing matrices from constant dimension codes ⋮ New constructions of Sidon spaces and large cyclic constant dimension codes ⋮ Multi-orbit cyclic subspace codes and linear sets ⋮ Constructions and equivalence of Sidon spaces ⋮ New lower bounds for partial k‐parallelisms ⋮ Subspace packings: constructions and bounds ⋮ Galois geometries and coding theory ⋮ EXISTENCE OF -ANALOGS OF STEINER SYSTEMS ⋮ Cyclic constant dimension subspace codes via the sum of Sidon spaces ⋮ New constructions of constant dimension codes by improved inserting construction ⋮ New and updated semidefinite programming bounds for subspace codes ⋮ Abelian non-cyclic orbit codes and multishot subspace codes ⋮ Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 ⋮ Linearized trinomials with maximum kernel ⋮ Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring ⋮ Cyclic orbit flag codes ⋮ Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects ⋮ New Lower Bounds for Binary Constant-Dimension Subspace Codes ⋮ Subspace code based on flats in affine space over finite fields ⋮ Bounds on subspace codes based on subspaces of type \((s,0,0,0)\) in pseudo-symplectic spaces and singular pseudo-symplectic spaces ⋮ Constructions of cyclic constant dimension codes ⋮ Covering of subspaces by subspaces ⋮ Residual \(q\)-Fano planes and related structures ⋮ A new approach for examining \(q\)-Steiner systems ⋮ The maximum size of a partial spread. II: Upper bounds ⋮ Constructions of optimal Ferrers diagram rank metric codes ⋮ Error-correcting codes in attenuated space over finite fields ⋮ Algebraic codes for network coding ⋮ Book spreads in \(\mathrm{PG}(7,2)\) ⋮ Several classes of optimal Ferrers diagram rank-metric codes ⋮ New constructions of orbit codes based on the operations of orbit codes ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2 ⋮ Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups ⋮ Further constructions of cyclic subspace codes ⋮ Automorphisms of Grassmann graphs over a residue class ring ⋮ Several kinds of large cyclic subspace codes via Sidon spaces ⋮ A family of linear codes from constant dimension subspace codes ⋮ Orbit codes from forms on vector spaces over a finite field ⋮ Johnson type bounds for mixed dimension subspace codes ⋮ An asymptotically optimal construction of almost affinely disjoint subspaces ⋮ Error-correcting codes based on partial linear maps of finite-dimensional vector spaces ⋮ A Note on Optimal Constant Dimension Codes ⋮ Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space ⋮ Flag codes: distance vectors and cardinality bounds ⋮ Perfect codes in the discrete simplex ⋮ Rank-Metric Codes and Their Applications ⋮ Equidistant codes in the Grassmannian ⋮ Cyclic orbit codes and stabilizer subfields ⋮ Subspace codes from Ferrers diagrams

This page was built for publication: Error-Correcting Codes in Projective Space