Error-Correcting Codes in Projective Space
From MaRDI portal
Publication:5281105
DOI10.1109/TIT.2010.2095232zbMath1366.94589MaRDI QIDQ5281105
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
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94B05: Linear codes (general theory)
94B65: Bounds on codes
14G50: Applications to coding theory and cryptography of arithmetic geometry
Related Items
New Lower Bounds for Binary Constant-Dimension Subspace Codes, Subspace code based on flats in affine space over finite fields, Unnamed Item, Unnamed Item, Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius, Unnamed Item, Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2, Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups, A Note on Optimal Constant Dimension Codes, Subspace codes from Ferrers diagrams, Bounds on subspace codes based on totally isotropic subspaces in unitary spaces, Rank-Metric Codes and Their Applications, 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, 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, New constructions of Sidon spaces and large cyclic constant dimension codes, Constructions and equivalence of Sidon spaces, On the extendability of particular classes of constant dimension codes, Construction of optimal constant-dimension subspace codes, Construction of subspace codes through linkage, Constructions and bounds for mixed-dimension subspace codes, 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, Nontrivial \(t\)-designs over finite fields exist for all \(t\), The maximum size of a partial spread. II: Upper bounds, Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects, A note on equidistant subspace codes, Galois geometries and coding theory, Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases, Constant dimension codes from Riemann-Roch spaces, Message encoding and retrieval for spread and cyclic orbit codes, Cores and independence numbers of Grassmann graphs, Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6, Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring, Constructions of cyclic constant dimension codes, Residual \(q\)-Fano planes and related structures, A new approach for examining \(q\)-Steiner systems, Constructions of optimal Ferrers diagram rank metric codes, Linearity and complements in projective space, Error-correcting codes in attenuated space over finite fields, Book spreads in \(\mathrm{PG}(7,2)\), 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, Further constructions of cyclic subspace codes, A family of linear codes from constant dimension subspace codes, Orbit codes from forms on vector spaces over a finite field, An asymptotically optimal construction of almost affinely disjoint subspaces, Error-correcting codes based on partial linear maps of finite-dimensional vector spaces, Flag codes: distance vectors and cardinality bounds, 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, Deterministic construction of compressed sensing matrices from constant dimension codes, Subspace packings: constructions and bounds, New and updated semidefinite programming bounds for subspace codes, Abelian non-cyclic orbit codes and multishot subspace codes, Linearized trinomials with maximum kernel, Cyclic orbit flag codes, Bounds on subspace codes based on subspaces of type \((s,0,0,0)\) in pseudo-symplectic spaces and singular pseudo-symplectic spaces, Covering of subspaces by subspaces, Algebraic codes for network coding, Several classes of optimal Ferrers diagram rank-metric codes, Automorphisms of Grassmann graphs over a residue class ring, Several kinds of large cyclic subspace codes via Sidon spaces, Johnson type bounds for mixed dimension subspace codes, Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space, Perfect codes in the discrete simplex, Equidistant codes in the Grassmannian, Cyclic orbit codes and stabilizer subfields, The maximum size of a partial spread in a finite projective space, Cyclic subspace codes via subspace polynomials, A characterization of cyclic subspace codes via subspace polynomials, Partial spreads in random network coding, Distance distributions of cyclic orbit codes, New constructions of large cyclic subspace codes and Sidon spaces, Constructions of large cyclic constant dimension codes via Sidon spaces, Further constructions of large cyclic subspace codes via Sidon spaces, Multi-orbit cyclic subspace codes and linear sets, Cyclic constant dimension subspace codes via the sum of Sidon spaces, New constructions of constant dimension codes by improved inserting construction, EXISTENCE OF -ANALOGS OF STEINER SYSTEMS, q-Analogs of Packing Designs
