Coding for Errors and Erasures in Random Network Coding
From MaRDI portal
Publication:3604797
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.
Recommendations
Cited in
(only showing first 100 items - show all)- Johnson type bounds on constant dimension codes
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Binary subspace codes in small ambient spaces
- Exceptional scattered polynomials
- Generalized Gabidulin codes over fields of any characteristic
- On the number of inequivalent Gabidulin codes
- On dually almost MRD codes
- Maximum scattered linear sets and MRD-codes
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
- Constant dimension codes from Riemann-Roch spaces
- On primitive constant dimension codes and a geometrical sunflower bound
- 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
- 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
- Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring
- AG codes, \(t\)-designs and partition sets
- A new family of MRD-codes
- Constructions of cyclic constant dimension codes
- Residual \(q\)-Fano planes and related structures
- A new approach for examining \(q\)-Steiner systems
- Constructions of optimal Ferrers diagram rank metric codes
- On deep holes of Gabidulin codes
- On the list decodability of self-orthogonal rank-metric codes
- Linearity and complements in projective space
- Fast decoding of Gabidulin codes
- A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
- Flag codes from planar spreads in network coding
- 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
- 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
- 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
- Error-correcting codes based on partial linear maps of finite-dimensional vector spaces
- 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
- On the list decodability of rank-metric codes containing Gabidulin codes
- Flag codes of maximum distance and constructions using Singer groups
- 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
- Constructions of Sidon spaces and cyclic subspace codes
- 50 years of translation structures
- Subspace code constructions
- Large sets of \(t\)-designs over finite fields exist for all \(t\)
- On sets of subspaces with two intersection dimensions and a geometrical junta bound
- Linear cutting blocking sets and minimal codes in the rank metric
- Systematic maximum sum rank codes
- Deterministic construction of compressed sensing matrices from constant dimension codes
- Subspace packings: constructions and bounds
- New and updated semidefinite programming bounds for subspace codes
- Abelian non-cyclic orbit codes and multishot subspace codes
- A new rank metric for convolutional codes
- Linearized trinomials with maximum kernel
- Cyclic orbit flag codes
- Bounds on subspace codes based on subspaces of type (s,0,0,0) in pseudo-symplectic spaces and singular pseudo-symplectic spaces
- Covering of subspaces by subspaces
- Kötter interpolation in skew polynomial rings
- Several classes of optimal Ferrers diagram rank-metric codes
- On \(q\)-covering designs
- Automorphisms of Grassmann graphs over a residue class ring
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- Subspaces intersecting in at most a point
- Several kinds of large cyclic subspace codes via Sidon spaces
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- Puncturing maximum rank distance codes
- Theory of supports for linear codes endowed with the sum-rank metric
- A construction of abelian non-cyclic orbit codes
- Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space
- Perfect codes in the discrete simplex
- Equidistant codes in the Grassmannian
- Cyclic orbit codes and stabilizer subfields
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- Enumerative coding for line polar Grassmannians with applications to codes
- Matroidal structure of skew polynomial rings with application to network coding
- Multicomponent codes with maximum code distance
- The maximum size of a partial spread in a finite projective space
- Cyclic subspace codes via subspace polynomials
- On kernels and nuclei of rank metric codes
- Nuclei and automorphism groups of generalized twisted Gabidulin codes
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)
