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.
- An asymptotically optimal construction of almost affinely disjoint subspaces (Q2081335) (← links)
- Encoding and decoding of several optimal rank metric codes (Q2096654) (← links)
- On the list decodability of rank-metric codes containing Gabidulin codes (Q2119948) (← links)
- Constructions of rank metric codes under actions of the unitary groups (Q2132523) (← links)
- Extending two families of maximum rank distance codes (Q2135573) (← links)
- New constructions of Sidon spaces (Q2137064) (← links)
- Further results on LCD generalized Gabidulin codes (Q2142968) (← links)
- Subspace code constructions (Q2147947) (← links)
- Non-minimum tensor rank Gabidulin codes (Q2154304) (← links)
- Twisted linearized Reed-Solomon codes: a skew polynomial framework (Q2168840) (← links)
- Linear cutting blocking sets and minimal codes in the rank metric (Q2169825) (← links)
- Equivalence and characterizations of linear rank-metric codes based on invariants (Q2197149) (← links)
- Partitions of matrix spaces with an application to \(q\)-rook polynomials (Q2198967) (← links)
- A new rank metric for convolutional codes (Q2220759) (← links)
- Low-rank parity-check codes over Galois rings (Q2227130) (← links)
- Bounds on subspace codes based on subspaces of type \((s,0,0,0)\) in pseudo-symplectic spaces and singular pseudo-symplectic spaces (Q2243293) (← links)
- Covering of subspaces by subspaces (Q2248651) (← links)
- A new upper bound for constant distance codes of generators on Hermitian polar spaces of type \(H(2d - 1, q^{2})\) (Q2255390) (← links)
- Several classes of optimal Ferrers diagram rank-metric codes (Q2273871) (← links)
- Partition-balanced families of codes and asymptotic enumeration in coding theory (Q2299619) (← links)
- Subspaces intersecting in at most a point (Q2302159) (← links)
- Rank-metric codes, linear sets, and their duality (Q2306904) (← links)
- On the sparseness of certain linear MRD codes (Q2309683) (← links)
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices (Q2310392) (← links)
- Puncturing maximum rank distance codes (Q2313418) (← links)
- Binary additive MRD codes with minimum distance \(n-1\) must contain a semifield spread set (Q2329397) (← links)
- Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space (Q2336478) (← links)
- Equidistant codes in the Grassmannian (Q2345600) (← links)
- Cyclic orbit codes and stabilizer subfields (Q2346710) (← links)
- A new method for ensuring anonymity and security in network coding (Q2355666) (← links)
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries (Q2363094) (← links)
- Multicomponent codes with maximum code distance (Q2364473) (← links)
- Improved upper bounds for partial spreads (Q2402972) (← links)
- On kernels and nuclei of rank metric codes (Q2408108) (← links)
- Spread decoding in extension fields (Q2434393) (← links)
- New MRD codes from linear cutting blocking sets (Q2678900) (← links)
- Duals of linearized Reed-Solomon codes (Q2678987) (← links)
- Cyclic constant dimension subspace codes via the sum of Sidon spaces (Q2697471) (← links)
- New constructions of constant dimension codes by improved inserting construction (Q2698184) (← links)
- Convolutional Codes in Rank Metric With Application to Random Network Coding (Q2977422) (← links)
- Coding for Errors and Erasures in Random Network Coding (Q3604797) (← links)
- Network information flow (Q4501758) (← links)
- Subspace code based on flats in affine space over finite fields (Q4644788) (← links)
- Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes (Q4991378) (← links)
- Generalized minimum rank distance of variable-rate linear network error correction codes (Q4996884) (← links)
- (Q5001000) (← links)
- (Q5009547) (← links)
- Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius (Q5041210) (← links)
- Common Complements of Linear Subspaces and the Sparseness of MRD Codes (Q5073706) (← links)
- New semifields and new MRD codes from skew polynomial rings (Q5108156) (← links)