A Rank-Metric Approach to Error Control in Random Network Coding
From MaRDI portal
Publication:3604802
Recommendations
Cited in
(only showing first 100 items - show all)- A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
- Randomized decoding of Gabidulin codes beyond the unique decoding radius
- Improved upper bounds for partial spreads
- Rank subcodes in multicomponent network coding
- Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
- Universal secure rank-metric coding schemes with optimal communication overheads
- A new upper bound for constant distance codes of generators on Hermitian polar spaces of type \(H(2d - 1, q^{2})\)
- Constant dimension codes from Riemann-Roch spaces
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- Concatenation of convolutional codes and rank metric codes for multi-shot network coding
- Message encoding and retrieval for spread and cyclic orbit codes
- Orbit codes from forms on vector spaces over a finite field
- Non-linear maximum rank distance codes
- Codes with the rank metric and matroids
- On (partial) unit memory codes based on Gabidulin codes
- The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
- Secure Error-Correction Network Coding in a Randomized Setting
- Encoding and decoding of several optimal rank metric codes
- A new construction of anticode-optimal Grassmannian codes
- Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes
- On the number of factorizations of polynomials over finite fields
- An algebraic approach for decoding spread codes
- Wei-type duality theorems for rank metric codes
- Partial \(k\)-parallelisms in finite projective spaces
- Construction of self-dual matrix codes
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Coding for Errors and Erasures 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
- Bounds on the cardinality of subspace codes with non-maximum code distance
- Roos bound for skew cyclic codes in Hamming and rank metric
- Constant rank-distance sets of Hermitian matrices and partial spreads in Hermitian polar spaces
- Binary subspace codes in small ambient spaces
- Generalized vector space partitions
- 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
- A note on equidistant subspace codes
- Equivalence and characterizations of linear rank-metric codes based on invariants
- Fast decoding of Gabidulin codes
- Covering of subspaces by subspaces
- Rank-metric codes and their applications
- Partitions of matrix spaces with an application to \(q\)-rook polynomials
- Multicomponent codes with maximum code distance
- A new method for ensuring anonymity and security in network coding
- On syndrome decoding of punctured Reed-Solomon and Gabidulin codes
- Error and erasure correcting algorithms for rank codes
- New semifields and new MRD codes from skew polynomial rings
- A new family of linear maximum rank distance codes
- Construction of subspace codes through linkage
- Constructions and bounds for mixed-dimension subspace codes
- Network coding with flags
- On kernels and nuclei of rank metric codes
- Some new non-additive maximum rank distance codes
- Convolutional Codes in Rank Metric With Application to Random Network Coding
- An enumeration of the equivalence classes of self-dual matrix codes
- Equidistant codes in the Grassmannian
- Spread decoding in extension fields
- Rank-metric codes, linear sets, and their duality
- Rank-metric codes and their duality theory
- Decoding of random network codes
- Subspaces intersecting in at most a point
- Cyclic orbit codes and stabilizer subfields
- Fast operations on linearized polynomials and their applications in coding theory
- Random matrices and codes for the erasure channel
- Galois geometries and coding theory
- On deep holes of Gabidulin codes
- On the list decodability of self-orthogonal rank-metric codes
- Maximum weight codewords of a linear rank-metric code
- Codes in the sum-rank metric: fundamentals and applications
- Several classes of optimal Ferrers diagram rank-metric codes
- Further results on LCD generalized Gabidulin codes
- On decoding additive generalized twisted Gabidulin codes
- New lower bounds for partial k‐parallelisms
- Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
- Extending two families of maximum rank distance codes
- Higher-degree symmetric rank-metric codes
- Linear cutting blocking sets and minimal codes in the rank metric
- Duals of linearized Reed-Solomon codes
- On the list decodability of rank-metric codes containing Gabidulin codes
- 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
- Combining subspace codes
- A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams
- Generalized minimum rank distance of variable-rate linear network error correction codes
- Short rank-metric codes and scattered subspaces
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- Subspace code based on flats in affine space over finite fields
- Almost affinely disjoint subspaces and covering Grassmannian codes
- An asymptotically optimal construction of almost affinely disjoint subspaces
- New constant dimension subspace codes from multilevel linkage construction
- On the rank decoding problem over finite principal ideal rings
- The MacWilliams identity for the skew rank metric
- Low-rank parity-check codes over Galois rings
- Constructions of rank metric codes under actions of the unitary groups
- Optimal Ferrers diagram rank-metric codes from MRD codes
- New constructions of Sidon spaces
- Non-minimum tensor rank Gabidulin codes
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)
