Pages that link to "Item:Q3604797"
From MaRDI portal
The following pages link to Coding for Errors and Erasures in Random Network Coding (Q3604797):
Displaying 50 items.
- On the extendability of particular classes of constant dimension codes (Q281294) (← links)
- Non-linear maximum rank distance codes (Q281322) (← links)
- Construction of optimal constant-dimension subspace codes (Q281823) (← links)
- Rank-metric codes and their duality theory (Q300402) (← links)
- New infinite series of 2-designs over the binary and ternary field (Q306061) (← 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)
- Automorphism groups of Gabidulin-like codes (Q330078) (← links)
- Higher distances for constant dimensions codes: the case of osculating spaces to a Veronese variety (Q337998) (← links)
- Rank subcodes in multicomponent network coding (Q361696) (← links)
- Information security in a random network coding network (Q383181) (← 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)
- Any network code comes from an algebraic curve taking osculating spaces (Q404953) (← links)
- Nontrivial \(t\)-designs over finite fields exist for all \(t\) (Q406567) (← links)
- Memoryless computation: new results, constructions, and extensions (Q476853) (← links)
- Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank (Q490875) (← links)
- On the automorphism group of a binary \(q\)-analog of the Fano plane (Q499497) (← links)
- MRD-codes and linear sets (Q516068) (← links)
- The maximum size of a partial spread. II: Upper bounds (Q526224) (← links)
- Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects (Q669602) (← links)
- Conditions for the existence of spreads in projective Hjelmslev spaces (Q670201) (← links)
- A control-theoretic approach to disseminating values and overcoming malicious links in wireless networks (Q694835) (← links)
- Generalized twisted Gabidulin codes (Q724996) (← links)
- Decoding of random network codes (Q764085) (← links)
- On (partial) unit memory codes based on Gabidulin codes (Q764387) (← links)
- MRD codes with maximum idealizers (Q776314) (← links)
- Hamming and simplex codes for the sum-rank metric (Q782849) (← links)
- Construction of self-dual matrix codes (Q782851) (← links)
- Optimum distance flag codes from spreads via perfect matchings in graphs (Q825551) (← links)
- An enumeration of the equivalence classes of self-dual matrix codes (Q894999) (← links)
- To the theory of \(q\)-ary Steiner and other-type trades (Q897311) (← links)
- A note on equidistant subspace codes (Q897616) (← links)
- Equidistant subspace codes (Q898789) (← links)
- Generalized weights: an anticode approach (Q899568) (← links)
- Galois geometries and coding theory (Q908053) (← links)
- Johnson type bounds on constant dimension codes (Q1009103) (← 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)
- Exceptional scattered polynomials (Q1643204) (← links)
- Generalized Gabidulin codes over fields of any characteristic (Q1650439) (← links)
- On the number of inequivalent Gabidulin codes (Q1650809) (← links)
- On dually almost MRD codes (Q1654489) (← links)
- Maximum scattered linear sets and MRD-codes (Q1686219) (← links)
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication (Q1689748) (← links)
- Constant dimension codes from Riemann-Roch spaces (Q1691237) (← links)
- On primitive constant dimension codes and a geometrical sunflower bound (Q1691245) (← links)
- Network coding with flags (Q1696043) (← links)
