A Random Linear Network Coding Approach to Multicast
From MaRDI portal
Publication:3548184
DOI10.1109/TIT.2006.881746zbMath1323.94010OpenAlexW2048235391MaRDI QIDQ3548184
No author found.
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2006.881746
Related Items
Matroidal structure of skew polynomial rings with application to network coding, On the extendability of particular classes of constant dimension codes, On fast and robust information spreading in the vertex-congest model, Induced weights on quotient modules and an application to error correction in coherent networks, Higher distances for constant dimensions codes: the case of osculating spaces to a Veronese variety, Minimum-energy wireless real-time multicast by joint network coding and scheduling optimization, MDS coding is better than replication for job completion times, Information security in a random network coding network, The truncated and supplemented Pascal matrix and applications, Max-flow min-cut theorems on dispersion and entropy measures for communication networks, List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques, Almost affinely disjoint subspaces and covering Grassmannian codes, Any network code comes from an algebraic curve taking osculating spaces, Equidistant subspace codes, Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty, Subspace packings: constructions and bounds, Galois geometries and coding theory, On Field Size and Success Probability in Network Coding, EXISTENCE OF -ANALOGS OF STEINER SYSTEMS, A computational perspective on network coding, Exact decoding probability of random linear network coding for combinatorial networks, Universal secure rank-metric coding schemes with optimal communication overheads, Cyclic orbit flag codes, Subspace code based on flats in affine space over finite fields, Bounds on subspace codes based on subspaces of type \((s,0,0,0)\) in pseudo-symplectic spaces and singular pseudo-symplectic spaces, An effective genetic algorithm for network coding, Coding and control for communication networks, Properties of sets of subspaces with constant intersection dimension, Architecture-aware coding for distributed storage: repairable block failure resilient codes, Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2, Johnson type bounds on constant dimension codes, Bounded-contention coding for the additive network model, Orbit codes from forms on vector spaces over a finite field, NETWORK CODING WITH MODULAR LATTICES, A Note on Optimal Constant Dimension Codes, Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space, Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture, Violations of the Ingleton inequality and revising the four-atom conjecture, Network information flow, Rank-Metric Codes and Their Applications, Codes in the Sum-Rank Metric: Fundamentals and Applications, Subspace codes from Ferrers diagrams, A new method for ensuring anonymity and security in network coding
