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.
- Further constructions of large cyclic subspace codes via Sidon spaces (Q2682851) (← links)
- Multi-orbit cyclic subspace codes and linear sets (Q2689356) (← 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)
- Improved generalized block inserting construction of constant dimension codes (Q2698341) (← links)
- A note on \(q\)-covering designs in \(\mathrm{PG}(5,q)\) (Q2817306) (← links)
- Two coloring problems on matrix graphs (Q2821120) (← links)
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS (Q2971026) (← links)
- NETWORK CODING WITH MODULAR LATTICES (Q3117930) (← links)
- <i>q</i>-Analogs of Packing Designs (Q3191439) (← links)
- On the Design of Storage Orbit Codes (Q3460473) (← links)
- Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach (Q3460704) (← links)
- Aspects of Random Network Coding (Q3461810) (← links)
- A Rank-Metric Approach to Error Control in Random Network Coding (Q3604802) (← links)
- Secure Error-Correction Network Coding in a Randomized Setting (Q3634339) (← links)
- Network information flow (Q4501758) (← links)
- New Lower Bounds for Binary Constant-Dimension Subspace Codes (Q4643732) (← links)
- Subspace code based on flats in affine space over finite fields (Q4644788) (← links)
- New Construction of Error-Tolerant Pooling Designs (Q4915255) (← links)
- (Q4964809) (← links)
- On Randomized Linear Network Codes and Their Error Correction Capabilities (Q4975921) (← links)
- Generalized minimum rank distance of variable-rate linear network error correction codes (Q4996884) (← links)
- (Q5001000) (← links)
- (Q5009547) (← links)
- Linear permutations and their compositional inverses over 𝔽qn (Q5039764) (← 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)
- Bounds on subspace codes based on totally isotropic subspace in symplectic spaces and extended symplectic spaces (Q5193469) (← links)
- Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2 (Q5205027) (← links)
- An Assmus--Mattson Theorem for Rank Metric Codes (Q5232151) (← links)
- (Q5241126) (← links)
- (Q5241165) (← links)
- Product of symplectic groups and its cyclic orbit code (Q5242835) (← links)
- Partial ‐Parallelisms in Finite Projective Spaces (Q5249055) (← links)
- Subspace codes from Ferrers diagrams (Q5272572) (← links)
- Bounds on subspace codes based on totally isotropic subspaces in unitary spaces (Q5298339) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- Codes in the Sum-Rank Metric: Fundamentals and Applications (Q5863766) (← links)
- Constant dimension codes from multilevel construction based on matchings of complete hypergraphs (Q6041574) (← links)
- LCP of rank metric codes and its an application (Q6046158) (← links)
- Construction of constant dimension codes via improved inserting construction (Q6056622) (← links)
- Almost affinely disjoint subspaces and covering Grassmannian codes (Q6063245) (← links)
- Optimal Ferrers diagram rank-metric codes from MRD codes (Q6070352) (← links)
- LCD subspace codes (Q6074021) (← links)
- Insdel codes from subspace and rank-metric codes (Q6080133) (← links)
- Generalized block inserting for constructing new constant dimension codes (Q6101845) (← links)
- Bilateral multilevel construction of constant dimension codes (Q6112215) (← links)
- Automorphism groups and isometries for cyclic orbit codes (Q6112226) (← links)
- Combining subspace codes (Q6112253) (← links)
- Constructions of optimum distance full flag codes (Q6156913) (← links)