A Rank-Metric Approach to Error Control in Random Network Coding
From MaRDI portal
Publication:3604802
DOI10.1109/TIT.2008.928291zbMATH Open1318.94119DBLPjournals/tit/SilvaKK08OpenAlexW2055060019WikidataQ59767801 ScholiaQ59767801MaRDI QIDQ3604802FDOQ3604802
R. Kötter, Frank R. Kschischang, Danilo Silva
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2008.928291
Recommendations
Cited In (only showing first 100 items - show all)
- Rank-metric codes, linear sets, and their duality
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- 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
- Fast operations on linearized polynomials and their applications in coding theory
- Optimal Ferrers diagram rank-metric codes from MRD codes
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Network coding with flags
- Non-linear maximum rank distance codes
- Binary subspace codes in small ambient spaces
- On syndrome decoding of punctured Reed-Solomon and Gabidulin codes
- Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes
- Constructions of cyclic constant dimension codes
- Constructions of optimal Ferrers diagram rank metric codes
- Rank-metric codes and their duality theory
- An efficient MAC scheme for secure network coding with probabilistic detection
- The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
- Fast decoding of Gabidulin codes
- A new method for ensuring anonymity and security in network coding
- Spread decoding in extension fields
- Partitions of matrix spaces with an application to \(q\)-rook polynomials
- Improved upper bounds for partial spreads
- Several classes of optimal Ferrers diagram rank-metric codes
- On the number of factorizations of polynomials over finite fields
- Rank-Metric Codes and Their Applications
- Constant rank-distance sets of Hermitian matrices and partial spreads in Hermitian polar spaces
- Subspaces intersecting in at most a point
- A new family of linear maximum rank distance codes
- Construction of subspace codes through linkage
- Constructions and bounds for mixed-dimension subspace codes
- Some new non-additive maximum rank distance codes
- Rank subcodes in multicomponent network coding
- Multicomponent codes with maximum code distance
- New semifields and new MRD codes from skew polynomial rings
- Partial ‐Parallelisms in Finite Projective Spaces
- A note on equidistant subspace codes
- Decoding of random network codes
- On (partial) unit memory codes based on Gabidulin codes
- Generalized vector space partitions
- An enumeration of the equivalence classes of self-dual matrix codes
- Galois geometries and coding theory
- Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes
- Wei-type duality theorems for rank metric codes
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- Convolutional Codes in Rank Metric With Application to Random Network Coding
- A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
- Orbit codes from forms on vector spaces over a finite field
- Construction of self-dual matrix codes
- Constant dimension codes from Riemann-Roch spaces
- Title not available (Why is that?)
- Equivalence and characterizations of linear rank-metric codes based on invariants
- Concatenation of convolutional codes and rank metric codes for multi-shot network coding
- Message encoding and retrieval for spread and cyclic orbit codes
- Bounds on the cardinality of subspace codes with non-maximum code distance
- Equidistant codes in the Grassmannian
- A new upper bound for constant distance codes of generators on Hermitian polar spaces of type \(H(2d - 1, q^{2})\)
- Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius
- Roos bound for skew cyclic codes in Hamming and rank metric
- Information security in a random network coding network
- Network information flow
- Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects
- Codes with the rank metric and matroids
- Encoding and decoding of several optimal rank metric codes
- Cyclic orbit codes and stabilizer subfields
- Covering of subspaces by subspaces
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- Maximum flag-rank distance codes
- Asymptotically optimal \([2k+1,k,k]_q\)-almost affinely disjoint subspaces
- Coding and Capacity Calculation for the $\mathcal{T}$ -User F-Adder Channel
- A new rank metric for convolutional codes
- On the list decodability of rank-metric codes containing Gabidulin codes
- Low-rank parity-check codes over Galois rings
- New constant dimension subspace codes from multilevel linkage construction
- On the rank decoding problem over finite principal ideal rings
- New constructions of constant dimension codes by improved inserting construction
- Extending two families of maximum rank distance codes
- Fast decoding of lifted interleaved linearized Reed-Solomon codes for multishot network coding
- Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
- Bounds on subspace codes based on subspaces of type \((s,0,0,0)\) in pseudo-symplectic spaces and singular pseudo-symplectic spaces
- Bilateral multilevel construction of constant dimension codes
- 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
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- Further results on LCD generalized Gabidulin codes
- A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams
- Codes in the Sum-Rank Metric: Fundamentals and Applications
- New lower bounds for partial k‐parallelisms
- LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
- Linear sets and MRD-codes arising from a class of scattered linearized polynomials
- Title not available (Why is that?)
- Puncturing maximum rank distance codes
- Combining subspace codes
- Short rank-metric codes and scattered subspaces
- Non-minimum tensor rank Gabidulin codes
- Maximum weight codewords of a linear rank-metric code
- On decoding additive generalized twisted Gabidulin codes
- Partition-balanced families of codes and asymptotic enumeration in coding theory
This page was built for publication: A Rank-Metric Approach to Error Control in Random Network Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604802)
