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)- Covering of subspaces by subspaces
- Error and erasure correcting algorithms for rank codes
- On a family of linear MRD codes with parameters \([8\times 8,16,7]_q\)
- New constant dimension subspace codes via generalized coset construction
- Rank-metric codes, linear sets, and their duality
- 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
- Construction of optimal flag codes by MRD codes
- Random matrices and codes for the erasure channel
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- On kernels and nuclei of rank metric codes
- Application of maximum distance separable codes in the error correction of the network coding
- A module minimization approach to Gabidulin decoding via interpolation
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- New scattered subspaces in higher dimensions
- Fast operations on linearized polynomials and their applications in coding theory
- The distance function on Coxeter-like graphs and self-dual codes
- Universal secure rank-metric coding schemes with optimal communication overheads
- A new rank metric for convolutional codes
- Maximum flag-rank distance codes
- Asymptotically optimal \([2k+1,k,k]_q\)-almost affinely disjoint subspaces
- Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
- Optimal Ferrers diagram rank-metric codes from MRD codes
- On the list decodability of rank-metric codes containing Gabidulin codes
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Low-rank parity-check codes over Galois rings
- Valued rank-metric codes
- Network coding with flags
- A new construction of anticode-optimal Grassmannian codes
- Non-linear maximum rank distance codes
- Binary subspace codes in small ambient spaces
- New constructions of constant dimension codes by improved inserting construction
- On syndrome decoding of punctured Reed-Solomon and Gabidulin codes
- New constant dimension subspace codes from multilevel linkage construction
- On the rank decoding problem over finite principal ideal rings
- Extending two families of maximum rank distance codes
- Improved syndrome decoding of lifted L-interleaved Gabidulin codes
- Bounds on subspace codes based on subspaces of type (s,0,0,0) in pseudo-symplectic spaces and singular pseudo-symplectic spaces
- Fast decoding of lifted interleaved linearized Reed-Solomon codes for multishot network coding
- Constructions of cyclic constant dimension codes
- Constructions of optimal Ferrers diagram rank metric codes
- Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
- Bilateral multilevel construction of constant dimension codes
- Rank-metric codes and their duality theory
- Randomized decoding of Gabidulin codes beyond the unique decoding radius
- 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
- 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
- Generalized minimum rank distance of variable-rate linear network error correction codes
- Spread decoding in extension fields
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- Further results on LCD generalized Gabidulin codes
- Coding and capacity calculation for the \(\mathcal{T}\)-user \(F\)-adder channel
- Partitions of matrix spaces with an application to \(q\)-rook polynomials
- Generalized bilateral multilevel construction for constant dimension codes
- Constructions of self-orthogonal and LCD subspace codes
- A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams
- Several classes of optimal Ferrers diagram rank-metric codes
- Improved upper bounds for partial spreads
- Constant rank-distance sets of Hermitian matrices and partial spreads in Hermitian polar spaces
- 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
- On the number of factorizations of polynomials over finite fields
- New lower bounds for partial k‐parallelisms
- Puncturing maximum rank distance codes
- 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
- Non-minimum tensor rank Gabidulin codes
- Rank subcodes in multicomponent network coding
- Some new non-additive maximum rank distance codes
- An algebraic approach for decoding spread codes
- Combining subspace codes
- On decoding additive generalized twisted Gabidulin codes
- Short rank-metric codes and scattered subspaces
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- Multicomponent codes with maximum code distance
- Maximum weight codewords of a linear rank-metric code
- Linear cutting blocking sets and minimal codes in the rank metric
- A note on equidistant subspace codes
- New semifields and new MRD codes from skew polynomial rings
- Exceptional scattered sequences
- Generalized bilateral multilevel construction for constant dimension codes from parallel mixed dimension construction
- Insdel codes from subspace and rank-metric codes
- Evasive subspaces, generalized rank weights and near MRD codes
- Decoding of random network codes
- Linearity and complements in projective space
- On (partial) unit memory codes based on Gabidulin codes
- Linear complete symmetric rank-distance codes
- Almost affinely disjoint subspaces and covering Grassmannian codes
- Towards the classification of exceptional scattered polynomials
- Secure Error-Correction Network Coding in a Randomized Setting
- An enumeration of the equivalence classes of self-dual matrix codes
- Galois geometries and 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)
