Linear network coding
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- The truncated and supplemented Pascal matrix and applications
- Random network coding over composite fields
- Universal secure rank-metric coding schemes with optimal communication overheads
- Representations of the multicast network problem
- Reliability evaluation of a multicast over coded packet networks
- An efficient MAC scheme for secure network coding with probabilistic detection
- Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding
- A computational perspective on network coding
- New constructions of orbit codes based on the operations of orbit codes
- Properties of sets of subspaces with constant intersection dimension
- Complexity of fixed point counting problems in Boolean networks
- Constructions of rank metric codes under actions of the unitary groups
- Linear cutting blocking sets and minimal codes in the rank metric
- Subspace packings: constructions and bounds
- Coding and control for communication networks
- Multicast triangular semilattice network
- Optimal-constrained multicast sub-graph over coded packet networks
- Network encoding complexity: exact values, bounds, and inequalities
- Max-flow min-cut theorems on dispersion and entropy measures for communication networks
- Spread decoding in extension fields
- Randomized and deterministic algorithms for network coding problems in wireless networks
- The one-out-of-\(k\) retrieval problem and linear network coding
- Partial spreads in random network coding
- Efficient quantum information processing via quantum compressions
- Construction of minimum bandwidth regenerating codes with combinatorial design
- Bounds for algebraic gossip on graphs
- How to construct strongly secure network coding scheme
- Exact decoding probability of random linear network coding for combinatorial networks
- Priority encoding transmission
- Network coding
- Impact of topology on the maximum multicast throughput in communication networks with network coding
- DD-POR: dynamic operations and direct repair in network coding-based proof of retrievability
- On networks of two-way channels
- Higher distances for constant dimensions codes: the case of osculating spaces to a Veronese variety
- Quadratic permutation polynomial sliding window-based network coding algorithm
- The one-out-of-\(k\) retrieval problem and linear network coding
- Reachability of random linear systems over finite fields
- On Field Size and Success Probability in Network Coding
- Polynomial-Time Construction of Linear Network Coding
- Some applications of finite geometry for secure network coding
- Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization
- Linearity and Solvability in Multicast Networks
- Insufficiency of Linear Coding in Network Information Flow
- Information flow decomposition for network coding
- Polynomial Time Algorithms for Multicast Network Code Construction
- The encoding complexity of network coding
- Matrix games in the multicast networks: maximum information flows with network switching.
- Minimum-Cost Multicast over Coded Packet Networks
- Zero-error network coding for acyclic networks
- A Random Linear Network Coding Approach to Multicast
- Reversible and Irreversible Information Networks
- Implementation of random linear network coding using nvidia's CUDA toolkit
- The serializability of network codes
- Network Coding Capacity With a Constrained Number of Coding Nodes
- Myopic Coding in Multiterminal Networks
- Linear Network Error Correction Codes in Packet Networks
- Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks
- Dualities Between Entropy Functions and Network Codes
- On the Delay and Throughput Gains of Coding in Unreliable Networks
- A construction method of matroidal networks
- Secure Error-Correction Network Coding in a Randomized Setting
- Interactive Communication, Diagnosis and Error Control in Networks
- Any network code comes from an algebraic curve taking osculating spaces
- Network coding for line networks with broadcast channels
- Linear-code multicast on parallel architectures
- A characterization of solvability for a class of networks
- Network information flow
- Finite dynamical systems, hat games, and coding theory
- Fundamentals of index coding
- scientific article; zbMATH DE number 2135149 (Why is no real title available?)
- Linear space bootstrap communication schemes
- Revisiting the linear information flow algorithm
- Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank
- Algebraic (trapdoor) one-way functions: constructions and applications
- Linearly Homomorphic Signatures with Designated Entities
- How to make a linear network code (strongly) secure
- The explicit coding rate region of symmetric multilevel diversity coding
- Optimal and heuristic network coding algorithms for multi-layered video broadcast
- An optimization algorithm of random linear network coding for relay nodes by linear correlation
- A robust optimization approach for multicast network coding under uncertain link costs
- Subspace codes from Ferrers diagrams
- Improved Jaggi-Sanders algorithms for constructing linear broadcast and linear dispersion network coding
- Variable-Rate Linear Network Coding
- Linear Codes, Target Function Classes, and Network Computing Capacity
- BATS codes: theory and practice
- Complex Linear Physical-Layer Network Coding
- Communication strategies and coding for relaying
- Structural routability of n-pairs information networks
- Complexity classification of network information flow problems
- An Outside Opinion
- Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis “Utilising Public Information in Network Coding”
- Violations of the Ingleton inequality and revising the four-atom conjecture.
- Rank-metric codes and their applications
- Codes in the sum-rank metric: fundamentals and applications
- Order optimal information spreading using algebraic gossip
- Network coding traffic design using column generation techniques
- Almost affinely disjoint subspaces and covering Grassmannian codes
- Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks
- Generalizations and applications of the nowhere zero linear mappings in network coding
- Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty
This page was built for publication: Linear network coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4679915)
