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)
- Generalized weights: an anticode approach
- Partial spreads in random network coding
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
- On transform-domain error and erasure correction by Gabidulin codes
- On kernels and nuclei of rank metric codes
- Random matrices and codes for the erasure channel
- Nontrivial \(t\)-designs over finite fields exist for all \(t\)
- A control-theoretic approach to disseminating values and overcoming malicious links in wireless networks
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- Network coding with modular lattices
- Aspects of Random Network Coding
- On the extendability of particular classes of constant dimension codes
- Non-linear maximum rank distance codes
- Construction of optimal constant-dimension subspace codes
- On the automorphism group of a binary \(q\)-analog of the Fano plane
- The maximum size of a partial spread in a finite projective space
- Rank-metric codes and their duality theory
- Johnson type bounds on constant dimension codes
- Fast decoding of Gabidulin codes
- New infinite series of 2-designs over the binary and ternary field
- On the design of storage orbit codes
- On Randomized Linear Network Codes and Their Error Correction Capabilities
- On the number of factorizations of polynomials over finite fields
- Subspaces intersecting in at most a point
- Maximum scattered linear sets and MRD-codes
- A new family of linear maximum rank distance codes
- Construction of subspace codes through linkage
- Constructions and bounds for mixed-dimension subspace codes
- Rank subcodes in multicomponent network coding
- A new family of MRD-codes
- Multicomponent codes with maximum code distance
- Existence of \(q\)-analogs of Steiner systems
- Automorphism groups of Gabidulin-like codes
- Higher distances for constant dimensions codes: the case of osculating spaces to a Veronese variety
- Any network code comes from an algebraic curve taking osculating spaces
- Generalized twisted Gabidulin codes
- Decoding of random network codes
- Memoryless computation: new results, constructions, and extensions
- On (partial) unit memory codes based on Gabidulin codes
- Network error correction. I: Basic concepts and upper bounds
- Network error correction. II: Lower bounds
- An enumeration of the equivalence classes of self-dual matrix codes
- Galois geometries and coding theory
- MRD codes with maximum idealizers
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- Large sets of \(t\)-designs over finite fields
- Subspace codes from Ferrers diagrams
- Error-correcting codes in attenuated space over finite fields
- Rank-metric codes and their applications
- A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
- Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank
- Constant dimension codes from Riemann-Roch spaces
- \(q\)-analogs of packing designs
- Equidistant codes in the Grassmannian
- Exceptional scattered polynomials
- On the number of inequivalent Gabidulin codes
- Information security in a random network coding network
- To the theory of \(q\)-ary Steiner and other-type trades
- Forms and linear network codes
- A Rank-Metric Approach to Error Control in Random Network Coding
- Network information flow
- 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
- MRD-codes and linear sets
- Kötter interpolation in skew polynomial rings
- Cyclic orbit codes and stabilizer subfields
- The maximum size of a partial spread. II: Upper bounds
- Optimum distance flag codes from spreads via perfect matchings in graphs
- Perfect codes in the discrete simplex
- New Construction of Error-Tolerant Pooling Designs
- Field coupling benefits signal exchange between colpitts systems
- 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
- A new construction of anticode-optimal Grassmannian codes
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Network coding with flags
- 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
- New lower bounds for binary constant-dimension subspace codes
- 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
- Randomized decoding of Gabidulin codes beyond the unique decoding radius
- 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
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)
