Coding for Errors and Erasures in Random Network Coding

DOI10.1109/TIT.2008.926449zbMath1318.94111arXivcs/0703061OpenAlexW2139416652WikidataQ59767805 ScholiaQ59767805MaRDI QIDQ3604797

Frank R. Kschischang, R. Kötter

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0703061

Mathematics Subject Classification ID

Other types of codes (94B60) Decoding (94B35) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (only showing first 100 items - show all)

On the list decodability of rank-metric codes containing Gabidulin codes ⋮ Flag codes of maximum distance and constructions using Singer groups ⋮ Optimum distance flag codes from spreads via perfect matchings in graphs ⋮ Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases ⋮ Binary subspace codes in small ambient spaces ⋮ On the extendability of particular classes of constant dimension codes ⋮ Non-linear maximum rank distance codes ⋮ Construction of optimal constant-dimension subspace codes ⋮ 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 ⋮ Rank-metric codes and their duality theory ⋮ New infinite series of 2-designs over the binary and ternary field ⋮ Constructions of Sidon spaces and cyclic subspace codes ⋮ Exceptional scattered polynomials ⋮ A new family of linear maximum rank distance codes ⋮ Construction of subspace codes through linkage ⋮ Constructions and bounds for mixed-dimension subspace codes ⋮ Automorphism groups of Gabidulin-like codes ⋮ Generalized Gabidulin codes over fields of any characteristic ⋮ On the number of inequivalent Gabidulin codes ⋮ Higher distances for constant dimensions codes: the case of osculating spaces to a Veronese variety ⋮ On dually almost MRD codes ⋮ Rank subcodes in multicomponent network coding ⋮ Information security in a random network coding network ⋮ 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 ⋮ Maximum scattered linear sets and MRD-codes ⋮ Fast decoding of Gabidulin codes ⋮ A complete characterization of irreducible cyclic orbit codes and their Plücker embedding ⋮ Any network code comes from an algebraic curve taking osculating spaces ⋮ Nontrivial \(t\)-designs over finite fields exist for all \(t\) ⋮ Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication ⋮ An enumeration of the equivalence classes of self-dual matrix codes ⋮ Constant dimension codes from Riemann-Roch spaces ⋮ On primitive constant dimension codes and a geometrical sunflower bound ⋮ To the theory of \(q\)-ary Steiner and other-type trades ⋮ A note on equidistant subspace codes ⋮ Equidistant subspace codes ⋮ Generalized weights: an anticode approach ⋮ 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 ⋮ Cores and independence numbers of Grassmann graphs ⋮ Galois geometries and coding theory ⋮ Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 ⋮ Types of spreads and duality of the parallelisms of \(\mathrm{PG}(3,5)\) with automorphisms of order 13 ⋮ Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes ⋮ Memoryless computation: new results, constructions, and extensions ⋮ Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring ⋮ Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank ⋮ Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects ⋮ Conditions for the existence of spreads in projective Hjelmslev spaces ⋮ On the automorphism group of a binary \(q\)-analog of the Fano plane ⋮ AG codes, \(t\)-designs and partition sets ⋮ A new family of MRD-codes ⋮ MRD-codes and linear sets ⋮ Constructions of cyclic constant dimension codes ⋮ Flag codes from planar spreads in network coding ⋮ 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 ⋮ A control-theoretic approach to disseminating values and overcoming malicious links in wireless networks ⋮ Field coupling benefits signal exchange between colpitts systems ⋮ Rank-metric complementary dual codes ⋮ Error-correcting codes in attenuated space over finite fields ⋮ Book spreads in \(\mathrm{PG}(7,2)\) ⋮ A stability result and a spectrum result on constant dimension codes ⋮ New constructions of orbit codes based on the operations of orbit codes ⋮ Properties of sets of subspaces with constant intersection dimension ⋮ Generalized twisted Gabidulin codes ⋮ An orbital construction of optimum distance flag codes ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ Improvement to the sunflower bound for a class of equidistant constant dimension subspace codes ⋮ 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 ⋮ Further constructions of cyclic subspace codes ⋮ On deep holes of Gabidulin codes ⋮ On the list decodability of self-orthogonal rank-metric codes ⋮ Johnson type bounds on constant dimension codes ⋮ Decoding of random network codes ⋮ On (partial) unit memory codes based on Gabidulin codes ⋮ A family of linear codes from constant dimension subspace codes ⋮ Bounds on the cardinality of subspace codes with non-maximum code distance ⋮ Orbit codes from forms on vector spaces over a finite field ⋮ MRD codes with maximum idealizers ⋮ Error-correcting codes based on partial linear maps of finite-dimensional vector spaces ⋮ Hamming and simplex codes for the sum-rank metric ⋮ Construction of self-dual matrix codes ⋮ Flag codes: distance vectors and cardinality bounds ⋮ On the \(P_3\)-hull numbers of \(q\)-Kneser graphs and Grassmann graphs ⋮ Phase transition of the 3-majority dynamics with uniform communication noise ⋮ Parallel sub-code construction for constant-dimension codes ⋮ Enhancing Echelon-Ferrers construction for constant dimension code ⋮ Self-orthogonal codes from equitable partitions of association schemes

This page was built for publication: Coding for Errors and Erasures in Random Network Coding