A Rank-Metric Approach to Error Control in Random Network Coding
From MaRDI portal
Publication:3604802
DOI10.1109/TIT.2008.928291zbMath1318.94119OpenAlexW2055060019WikidataQ59767801 ScholiaQ59767801MaRDI QIDQ3604802
R. Kötter, Frank R. Kschischang, Danilo Silva
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2008.928291
Related Items (only showing first 100 items - show all)
Constant dimension codes from multilevel construction based on matchings of complete hypergraphs ⋮ Construction of constant dimension codes via improved inserting construction ⋮ Almost affinely disjoint subspaces and covering Grassmannian codes ⋮ Optimal Ferrers diagram rank-metric codes from MRD codes ⋮ Insdel codes from subspace and rank-metric codes ⋮ Evasive subspaces, generalized rank weights and near MRD codes ⋮ Bilateral multilevel construction of constant dimension codes ⋮ Constructions of optimal rank-metric codes from automorphisms of rational function fields ⋮ Combining subspace codes ⋮ On a family of linear MRD codes with parameters \([8\times 8,16,7_q\)] ⋮ Degenerate flag varieties in network coding ⋮ New lower bounds for partial k‐parallelisms ⋮ On the list decodability of rank-metric codes containing Gabidulin codes ⋮ Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries ⋮ Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases ⋮ Binary subspace codes in small ambient spaces ⋮ Multicomponent codes with maximum code distance ⋮ Non-linear maximum rank distance codes ⋮ Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius ⋮ Constructions of rank metric codes under actions of the unitary groups ⋮ Extending two families of maximum rank distance codes ⋮ New constructions of Sidon spaces ⋮ Rank-metric codes and their duality theory ⋮ Fast operations on linearized polynomials and their applications in coding theory ⋮ Further results on LCD generalized Gabidulin codes ⋮ Subspace code constructions ⋮ A new family of linear maximum rank distance codes ⋮ Construction of subspace codes through linkage ⋮ Constructions and bounds for mixed-dimension subspace codes ⋮ Non-minimum tensor rank Gabidulin codes ⋮ Common Complements of Linear Subspaces and the Sparseness of MRD Codes ⋮ Rank subcodes in multicomponent network coding ⋮ Twisted linearized Reed-Solomon codes: a skew polynomial framework ⋮ Linear cutting blocking sets and minimal codes in the rank metric ⋮ Improved upper bounds for partial spreads ⋮ On kernels and nuclei of rank metric codes ⋮ Information security in a random network coding network ⋮ 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 ⋮ On transform-domain error and erasure correction by Gabidulin codes ⋮ Fast decoding of Gabidulin codes ⋮ A complete characterization of irreducible cyclic orbit codes and their Plücker embedding ⋮ New MRD codes from linear cutting blocking sets ⋮ Duals of linearized Reed-Solomon codes ⋮ Constant rank-distance sets of Hermitian matrices and partial spreads in Hermitian polar spaces ⋮ An enumeration of the equivalence classes of self-dual matrix codes ⋮ Constant dimension codes from Riemann-Roch spaces ⋮ New semifields and new MRD codes from skew polynomial rings ⋮ A note on equidistant subspace codes ⋮ Unnamed Item ⋮ Network coding with flags ⋮ Concatenation of convolutional codes and rank metric codes for multi-shot network coding ⋮ Message encoding and retrieval for spread and cyclic orbit codes ⋮ Equivalence and characterizations of linear rank-metric codes based on invariants ⋮ Some new non-additive maximum rank distance codes ⋮ Partitions of matrix spaces with an application to \(q\)-rook polynomials ⋮ Galois geometries and coding theory ⋮ Unnamed Item ⋮ Spread decoding in extension fields ⋮ Cyclic constant dimension subspace codes via the sum of Sidon spaces ⋮ New constructions of constant dimension codes by improved inserting construction ⋮ A new rank metric for convolutional codes ⋮ Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes ⋮ Low-rank parity-check codes over Galois rings ⋮ Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects ⋮ On syndrome decoding of punctured Reed-Solomon and Gabidulin 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 ⋮ Roos bound for skew cyclic codes in Hamming and rank metric ⋮ Constructions of optimal Ferrers diagram rank metric codes ⋮ Codes with the rank metric and matroids ⋮ A new upper bound for constant distance codes of generators on Hermitian polar spaces of type \(H(2d - 1, q^{2})\) ⋮ An efficient MAC scheme for secure network coding with probabilistic detection ⋮ Several classes of optimal Ferrers diagram rank-metric codes ⋮ Generalized vector space partitions ⋮ The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ On the number of factorizations of polynomials over finite fields ⋮ Linear sets and MRD-codes arising from a class of scattered linearized polynomials ⋮ On decoding additive generalized twisted Gabidulin codes ⋮ On deep holes of Gabidulin codes ⋮ On the list decodability of self-orthogonal rank-metric codes ⋮ Partition-balanced families of codes and asymptotic enumeration in coding theory ⋮ Subspaces intersecting in at most a point ⋮ Rank-metric codes, linear sets, and their duality ⋮ On the sparseness of certain linear MRD codes ⋮ Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices ⋮ Puncturing maximum rank distance codes ⋮ Decoding of random network codes ⋮ On (partial) unit memory codes based on Gabidulin codes ⋮ Bounds on the cardinality of subspace codes with non-maximum code distance ⋮ Orbit codes from forms on vector spaces over a finite field ⋮ Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes ⋮ An asymptotically optimal construction of almost affinely disjoint subspaces ⋮ Wei-type duality theorems for rank metric codes ⋮ Construction of self-dual matrix codes
This page was built for publication: A Rank-Metric Approach to Error Control in Random Network Coding
