Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
From MaRDI portal
Publication:4975905
DOI10.1109/TIT.2009.2021376zbMath1367.94414arXiv0807.4846OpenAlexW2098313715MaRDI QIDQ4975905
Natalia Silberstein, Tuvi Etzion
Publication date: 8 August 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.4846
Combinatorial aspects of representation theory (05E10) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Related Items
Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases, Binary subspace codes in small ambient spaces, 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, Partial spreads in random network coding, Construction of subspace codes through linkage, Rank subcodes in multicomponent network coding, Improved upper bounds for partial spreads, 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, Construction of constant dimension codes via improved inserting construction, A complete characterization of irreducible cyclic orbit codes and their Plücker embedding, Almost affinely disjoint subspaces and covering Grassmannian codes, Optimal Ferrers diagram rank-metric codes from MRD codes, A characterization of cyclic subspace codes via subspace polynomials, Constant dimension codes from Riemann-Roch spaces, Generalized block inserting for constructing new constant dimension codes, Bilateral multilevel construction of constant dimension codes, The interplay of different metrics for the construction of constant dimension codes, Constructions of optimal rank-metric codes from automorphisms of rational function fields, Combining subspace codes, A note on equidistant subspace codes, Unnamed Item, Message encoding and retrieval for spread and cyclic orbit codes, Equivalence and characterizations of linear rank-metric codes based on invariants, New lower bounds for partial k‐parallelisms, Subspace packings: constructions and bounds, Galois geometries and coding theory, Spread decoding in extension fields, New constructions of constant dimension codes by improved inserting construction, Improved generalized block inserting construction of constant dimension codes, New and updated semidefinite programming bounds for subspace codes, Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6, Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank, Covering of subspaces by subspaces, A new approach for examining \(q\)-Steiner systems, Constructions of optimal Ferrers diagram rank metric codes, Several classes of optimal Ferrers diagram rank-metric codes, Several kinds of large cyclic subspace codes via Sidon spaces, Orbit codes from forms on vector spaces over a finite field, Partial ‐Parallelisms in Finite Projective Spaces, Parallel sub-code construction for constant-dimension codes, Enhancing Echelon-Ferrers construction for constant dimension code, Equidistant codes in the Grassmannian, Cyclic orbit codes and stabilizer subfields, Subspace codes from Ferrers diagrams
