Pages that link to "Item:Q3604802"
From MaRDI portal
The following pages link to A Rank-Metric Approach to Error Control in Random Network Coding (Q3604802):
Displaying 50 items.
- Non-linear maximum rank distance codes (Q281322) (← links)
- Rank-metric codes and their duality theory (Q300402) (← links)
- A new family of linear maximum rank distance codes (Q326326) (← links)
- Construction of subspace codes through linkage (Q326332) (← links)
- Constructions and bounds for mixed-dimension subspace codes (Q326349) (← links)
- Rank subcodes in multicomponent network coding (Q361696) (← links)
- Information security in a random network coding network (Q383181) (← links)
- An algebraic approach for decoding spread codes (Q394834) (← links)
- On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes (Q398944) (← links)
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques (Q398965) (← links)
- On transform-domain error and erasure correction by Gabidulin codes (Q398969) (← links)
- Constant rank-distance sets of Hermitian matrices and partial spreads in Hermitian polar spaces (Q405107) (← links)
- Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects (Q669602) (← links)
- Decoding of random network codes (Q764085) (← links)
- On (partial) unit memory codes based on Gabidulin codes (Q764387) (← links)
- Wei-type duality theorems for rank metric codes (Q782848) (← links)
- Construction of self-dual matrix codes (Q782851) (← links)
- Random matrices and codes for the erasure channel (Q848850) (← links)
- An enumeration of the equivalence classes of self-dual matrix codes (Q894999) (← links)
- A note on equidistant subspace codes (Q897616) (← links)
- Galois geometries and coding theory (Q908053) (← links)
- Error and erasure correcting algorithms for rank codes (Q1009077) (← links)
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases (Q1620975) (← links)
- Binary subspace codes in small ambient spaces (Q1620978) (← links)
- Fast operations on linearized polynomials and their applications in coding theory (Q1635282) (← links)
- Constant dimension codes from Riemann-Roch spaces (Q1691237) (← links)
- Network coding with flags (Q1696043) (← links)
- Concatenation of convolutional codes and rank metric codes for multi-shot network coding (Q1696046) (← links)
- Message encoding and retrieval for spread and cyclic orbit codes (Q1696050) (← links)
- Some new non-additive maximum rank distance codes (Q1696763) (← links)
- Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes (Q1727368) (← links)
- Universal secure rank-metric coding schemes with optimal communication overheads (Q1733972) (← links)
- On syndrome decoding of punctured Reed-Solomon and Gabidulin codes (Q1743273) (← links)
- Constructions of cyclic constant dimension codes (Q1752543) (← links)
- Constructions of optimal Ferrers diagram rank metric codes (Q1755997) (← links)
- An efficient MAC scheme for secure network coding with probabilistic detection (Q1762208) (← links)
- The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters (Q1791705) (← links)
- On deep holes of Gabidulin codes (Q1800701) (← links)
- On the list decodability of self-orthogonal rank-metric codes (Q1800706) (← links)
- Linearity and complements in projective space (Q1932582) (← links)
- Fast decoding of Gabidulin codes (Q1934220) (← links)
- A complete characterization of irreducible cyclic orbit codes and their Plücker embedding (Q1934230) (← links)
- Roos bound for skew cyclic codes in Hamming and rank metric (Q1995207) (← links)
- Codes with the rank metric and matroids (Q1999898) (← links)
- LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding (Q2034992) (← links)
- On the number of factorizations of polynomials over finite fields (Q2037165) (← links)
- Linear sets and MRD-codes arising from a class of scattered linearized polynomials (Q2038880) (← links)
- On decoding additive generalized twisted Gabidulin codes (Q2040309) (← links)
- Bounds on the cardinality of subspace codes with non-maximum code distance (Q2068654) (← links)
- Orbit codes from forms on vector spaces over a finite field (Q2070263) (← links)