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
- A characterization of cyclic subspace codes via subspace polynomials
- 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)\)
- 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
- 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
- q-Analogs of Packing Designs
- 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 Randomized Linear Network Codes and Their Error Correction Capabilities
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
- On the number of factorizations of polynomials over finite fields
- Rank-Metric Codes and Their Applications
- 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
- 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
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)
