Coding for Errors and Erasures in Random Network Coding
From MaRDI portal
Publication:3604797
DOI10.1109/TIT.2008.926449zbMATH Open1318.94111DBLPjournals/tit/KoetterK08arXivcs/0703061OpenAlexW2139416652WikidataQ59767805 ScholiaQ59767805MaRDI QIDQ3604797FDOQ3604797
Authors: R. Kötter, Frank R. Kschischang 
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: The problem of error-control in random linear network coding is considered. A ``noncoherent or ``channel oblivious model is assumed where neither transmitter nor receiver is assumed to have knowledge of the channel transfer characteristic. Motivated by the property that linear network coding is vector-space preserving, information transmission is modelled as the injection into the network of a basis for a vector space and the collection by the receiver of a basis for a vector space . A metric on the projective geometry associated with the packet space is introduced, and it is shown that a minimum distance decoder for this metric achieves correct decoding if the dimension of the space is sufficiently large. If the dimension of each codeword is restricted to a fixed integer, the code forms a subset of a finite-field Grassmannian, or, equivalently, a subset of the vertices of the corresponding Grassmann graph. Sphere-packing and sphere-covering bounds as well as a generalization of the Singleton bound are provided for such codes. Finally, a Reed-Solomon-like code construction, related to Gabidulin's construction of maximum rank-distance codes, is described and a Sudan-style ``list-1 minimum distance decoding algorithm is provided.
Full work available at URL: https://arxiv.org/abs/cs/0703061
Recommendations
Decoding (94B35) Other types of codes (94B60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cited In (only showing first 100 items - show all)
- Parallel sub-code construction for constant-dimension codes
- Enhancing Echelon-Ferrers construction for constant dimension code
- New constructions of Sidon spaces and large cyclic constant dimension codes
- Constructions and equivalence of Sidon spaces
- A new rank metric for convolutional codes
- LCD subspace codes
- On the list decodability of rank-metric codes containing Gabidulin codes
- Improved generalized block inserting construction of constant dimension codes
- New constructions of constant dimension codes by improved inserting construction
- Rank-metric complementary dual codes
- Abelian non-cyclic orbit codes and multishot subspace codes
- Cyclic orbit flag codes
- Deterministic construction of compressed sensing matrices from constant dimension codes
- Bounds on subspace codes based on subspaces of type \((s,0,0,0)\) in pseudo-symplectic spaces and singular pseudo-symplectic spaces
- New constant dimension subspace codes from block inserting constructions
- Book spreads in \(\mathrm{PG}(7,2)\)
- Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space
- Constructions of rank metric codes under actions of the unitary groups
- New constructions of Sidon spaces
- New constructions of orbit codes based on the operations of orbit codes
- Properties of sets of subspaces with constant intersection dimension
- Product of symplectic groups and its cyclic orbit code
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- Constructions of Sidon spaces and cyclic subspace codes
- An orbital construction of optimum distance flag codes
- 50 years of translation structures
- 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
- Linear sets and MRD-codes arising from a class of scattered linearized polynomials
- Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach
- Puncturing maximum rank distance codes
- Title not available (Why is that?)
- Combining subspace codes
- Large sets of \(t\)-designs over finite fields exist for all \(t\)
- Distance distributions of cyclic orbit codes
- New constructions of large cyclic subspace codes and Sidon spaces
- Further constructions of cyclic subspace codes
- On decoding additive generalized twisted Gabidulin codes
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- Linear cutting blocking sets and minimal codes in the rank metric
- Almost affinely disjoint subspaces and covering Grassmannian codes
- On sets of subspaces with two intersection dimensions and a geometrical junta bound
- Common Complements of Linear Subspaces and the Sparseness of MRD Codes
- Several kinds of large cyclic subspace codes via Sidon spaces
- An Assmus--Mattson Theorem for Rank Metric Codes
- Construction of constant dimension codes via improved inserting construction
- Systematic maximum sum rank codes
- Error-correcting codes based on partial linear maps of finite-dimensional vector spaces
- Degenerate flag varieties in network coding
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Subspace packings: constructions and bounds
- Phase transition of the 3-majority dynamics with uniform communication noise
- Bounds on subspace codes based on totally isotropic subspaces in unitary spaces
- Flag codes of maximum distance and constructions using Singer groups
- Subspace code constructions
- Optimum distance flag codes from spreads via perfect matchings in graphs
- Perfect codes in the discrete simplex
- New Construction of Error-Tolerant Pooling Designs
- Linearized trinomials with maximum kernel
- Equidistant subspace codes
- Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring
- Constructions of optimum distance full flag codes
- Theory of supports for linear codes endowed with the sum-rank metric
- Optimal Ferrers diagram rank-metric codes from MRD codes
- On \(q\)-covering designs
- Generalized block inserting for constructing new constant dimension codes
- Asymptotic behaviour of codes in rank metric over finite fields
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Network coding with flags
- A characterization of cyclic subspace codes via subspace polynomials
- Binary subspace codes in small ambient spaces
- AG codes, \(t\)-designs and partition sets
- Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes
- A family of linear codes from constant dimension subspace codes
- Types of spreads and duality of the parallelisms of \(\mathrm{PG}(3,5)\) with automorphisms of order 13
- Flag codes from planar spreads in network coding
- Flag codes: distance vectors and cardinality bounds
- Constructions of cyclic constant dimension codes
- Residual \(q\)-Fano planes and related structures
- Constructions of optimal Ferrers diagram rank metric codes
- Spread decoding in extension fields
- On the \(P_3\)-hull numbers of \(q\)-Kneser graphs and Grassmann graphs
- Several classes of optimal Ferrers diagram rank-metric codes
- Cyclic subspace codes via subspace polynomials
- Generalized Gabidulin codes over fields of any characteristic
- On dually almost MRD codes
- New and updated semidefinite programming bounds for subspace codes
- Partial ‐Parallelisms in Finite Projective Spaces
- A note on equidistant subspace codes
- Matroidal structure of skew polynomial rings with application to network coding
- Linearity and complements in projective space
- Secure Error-Correction Network Coding in a Randomized Setting
- Nuclei and automorphism groups of generalized twisted Gabidulin codes
- On deep holes of Gabidulin codes
- On the list decodability of self-orthogonal rank-metric codes
- A construction of abelian non-cyclic orbit codes
- A new approach for examining \(q\)-Steiner systems
- Orbit codes from forms on vector spaces over a finite field
- Automorphism groups and isometries for cyclic orbit codes
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
This page was built for publication: Coding for Errors and Erasures in Random Network Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604797)
