Pages that link to "Item:Q3548184"
From MaRDI portal
The following pages link to A Random Linear Network Coding Approach to Multicast (Q3548184):
Displaying 43 items.
- On the extendability of particular classes of constant dimension codes (Q281294) (← links)
- Higher distances for constant dimensions codes: the case of osculating spaces to a Veronese variety (Q337998) (← links)
- Information security in a random network coding network (Q383181) (← links)
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques (Q398965) (← links)
- Any network code comes from an algebraic curve taking osculating spaces (Q404953) (← links)
- Bounded-contention coding for the additive network model (Q748114) (← links)
- Equidistant subspace codes (Q898789) (← links)
- Galois geometries and coding theory (Q908053) (← links)
- Johnson type bounds on constant dimension codes (Q1009103) (← links)
- On fast and robust information spreading in the vertex-congest model (Q1625611) (← links)
- Induced weights on quotient modules and an application to error correction in coherent networks (Q1637194) (← links)
- Minimum-energy wireless real-time multicast by joint network coding and scheduling optimization (Q1665573) (← links)
- The truncated and supplemented Pascal matrix and applications (Q1684516) (← links)
- Universal secure rank-metric coding schemes with optimal communication overheads (Q1733972) (← links)
- An effective genetic algorithm for network coding (Q1762065) (← links)
- Architecture-aware coding for distributed storage: repairable block failure resilient codes (Q1784988) (← links)
- A computational perspective on network coding (Q1958831) (← links)
- Properties of sets of subspaces with constant intersection dimension (Q2025357) (← links)
- Orbit codes from forms on vector spaces over a finite field (Q2070263) (← links)
- Subspace packings: constructions and bounds (Q2200513) (← links)
- Cyclic orbit flag codes (Q2232124) (← 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)
- Coding and control for communication networks (Q2269497) (← links)
- Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space (Q2336478) (← links)
- A new method for ensuring anonymity and security in network coding (Q2355666) (← links)
- Matroidal structure of skew polynomial rings with application to network coding (Q2363334) (← links)
- Max-flow min-cut theorems on dispersion and entropy measures for communication networks (Q2417851) (← links)
- MDS coding is better than replication for job completion times (Q2661596) (← links)
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS (Q2971026) (← links)
- Exact decoding probability of random linear network coding for combinatorial networks (Q2993813) (← links)
- NETWORK CODING WITH MODULAR LATTICES (Q3117930) (← links)
- On Field Size and Success Probability in Network Coding (Q3519560) (← links)
- Network information flow (Q4501758) (← links)
- Subspace code based on flats in affine space over finite fields (Q4644788) (← links)
- Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture (Q5009787) (← links)
- Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2 (Q5205027) (← links)
- A Note on Optimal Constant Dimension Codes (Q5250281) (← links)
- Subspace codes from Ferrers diagrams (Q5272572) (← links)
- Violations of the Ingleton inequality and revising the four-atom conjecture (Q5858542) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- Codes in the Sum-Rank Metric: Fundamentals and Applications (Q5863766) (← links)
- Almost affinely disjoint subspaces and covering Grassmannian codes (Q6063245) (← links)
- Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty (Q6176403) (← links)
