Linear network coding
From MaRDI portal
Publication:4679915
DOI10.1109/TIT.2002.807285zbMath1063.94004MaRDI QIDQ4679915
Shuo-Yen Robert Li, Ning Cai, Raymond W. Yeung
Publication date: 31 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (58)
Complexity of fixed point counting problems in Boolean networks ⋮ Efficient quantum information processing via quantum compressions ⋮ On fast and robust information spreading in the vertex-congest model ⋮ Constructions of rank metric codes under actions of the unitary groups ⋮ Linearly Homomorphic Signatures with Designated Entities ⋮ Partial spreads in random network coding ⋮ Reachability of Random Linear Systems over Finite Fields ⋮ Higher distances for constant dimensions codes: the case of osculating spaces to a Veronese variety ⋮ Bounds for algebraic gossip on graphs ⋮ DD-POR: Dynamic Operations and Direct Repair in Network Coding-Based Proof of Retrievability ⋮ A construction method of matroidal networks ⋮ Linear cutting blocking sets and minimal codes in the rank metric ⋮ Network encoding complexity: exact values, bounds, and inequalities ⋮ Finite Dynamical Systems, Hat Games, and Coding Theory ⋮ How to Construct Strongly Secure Network Coding Scheme ⋮ The truncated and supplemented Pascal matrix and applications ⋮ Generalizations and applications of the nowhere zero linear mappings in network coding ⋮ Max-flow min-cut theorems on dispersion and entropy measures for communication networks ⋮ Almost affinely disjoint subspaces and covering Grassmannian codes ⋮ On decoding of DVR-based linear network codes ⋮ Any network code comes from an algebraic curve taking osculating spaces ⋮ Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks ⋮ Network coding for quantum cooperative multicast ⋮ 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 ⋮ Linear-code multicast on parallel architectures ⋮ Galois geometries and coding theory ⋮ Spread decoding in extension fields ⋮ On Field Size and Success Probability in Network Coding ⋮ A characterization of solvability for a class of networks ⋮ Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding ⋮ A computational perspective on network coding ⋮ Order optimal information spreading using algebraic gossip ⋮ Some applications of finite geometry for secure network coding ⋮ Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization ⋮ Exact decoding probability of random linear network coding for combinatorial networks ⋮ Universal secure rank-metric coding schemes with optimal communication overheads ⋮ Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank ⋮ Secure quantum network coding based on quantum homomorphic message authentication ⋮ Algebraic (trapdoor) one-way functions: constructions and applications ⋮ Reliability evaluation of a multicast over coded packet networks ⋮ How to make a linear network code (strongly) secure ⋮ A robust optimization approach for multicast network coding under uncertain link costs ⋮ An efficient MAC scheme for secure network coding with probabilistic detection ⋮ New constructions of orbit codes based on the operations of orbit codes ⋮ Properties of sets of subspaces with constant intersection dimension ⋮ Multicast triangular semilattice network ⋮ Secure Error-Correction Network Coding in a Randomized Setting ⋮ Interactive Communication, Diagnosis and Error Control in Networks ⋮ Construction of minimum bandwidth regenerating codes with combinatorial design ⋮ Structural Routability of n-Pairs Information Networks ⋮ Violations of the Ingleton inequality and revising the four-atom conjecture ⋮ Network information flow ⋮ Optimal-constrained multicast sub-graph over coded packet networks ⋮ Rank-Metric Codes and Their Applications ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications ⋮ Subspace codes from Ferrers diagrams
This page was built for publication: Linear network coding
