The following pages link to Linear network coding (Q4679915):
Displaying 50 items.
- Efficient quantum information processing via quantum compressions (Q267267) (← links)
- Higher distances for constant dimensions codes: the case of osculating spaces to a Veronese variety (Q337998) (← links)
- A construction method of matroidal networks (Q362156) (← links)
- Any network code comes from an algebraic curve taking osculating spaces (Q404953) (← links)
- Linear-code multicast on parallel architectures (Q427139) (← links)
- A characterization of solvability for a class of networks (Q439763) (← links)
- Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank (Q490875) (← links)
- Algebraic (trapdoor) one-way functions: constructions and applications (Q500981) (← links)
- How to make a linear network code (strongly) secure (Q510412) (← links)
- A robust optimization approach for multicast network coding under uncertain link costs (Q526429) (← links)
- Generalizations and applications of the nowhere zero linear mappings in network coding (Q616419) (← links)
- Secure quantum network coding based on quantum homomorphic message authentication (Q669822) (← links)
- On decoding of DVR-based linear network codes (Q893345) (← links)
- Network coding for quantum cooperative multicast (Q898480) (← links)
- Equidistant subspace codes (Q898789) (← links)
- Galois geometries and coding theory (Q908053) (← links)
- On fast and robust information spreading in the vertex-congest model (Q1625611) (← links)
- The truncated and supplemented Pascal matrix and applications (Q1684516) (← links)
- Universal secure rank-metric coding schemes with optimal communication overheads (Q1733972) (← links)
- Reliability evaluation of a multicast over coded packet networks (Q1743495) (← links)
- An efficient MAC scheme for secure network coding with probabilistic detection (Q1762208) (← links)
- Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding (Q1954207) (← links)
- A computational perspective on network coding (Q1958831) (← links)
- New constructions of orbit codes based on the operations of orbit codes (Q2025223) (← links)
- Properties of sets of subspaces with constant intersection dimension (Q2025357) (← links)
- Complexity of fixed point counting problems in Boolean networks (Q2119407) (← links)
- Constructions of rank metric codes under actions of the unitary groups (Q2132523) (← links)
- Linear cutting blocking sets and minimal codes in the rank metric (Q2169825) (← links)
- Subspace packings: constructions and bounds (Q2200513) (← links)
- Multicast triangular semilattice network (Q2292588) (← links)
- Optimal-constrained multicast sub-graph over coded packet networks (Q2343995) (← links)
- Network encoding complexity: exact values, bounds, and inequalities (Q2408285) (← links)
- Max-flow min-cut theorems on dispersion and entropy measures for communication networks (Q2417851) (← links)
- Spread decoding in extension fields (Q2434393) (← links)
- Partial spreads in random network coding (Q2637329) (← links)
- Construction of minimum bandwidth regenerating codes with combinatorial design (Q2825280) (← links)
- Bounds for algebraic gossip on graphs (Q2925522) (← links)
- How to Construct Strongly Secure Network Coding Scheme (Q2948249) (← links)
- Exact decoding probability of random linear network coding for combinatorial networks (Q2993813) (← links)
- DD-POR: Dynamic Operations and Direct Repair in Network Coding-Based Proof of Retrievability (Q3196428) (← links)
- Reachability of Random Linear Systems over Finite Fields (Q3460468) (← links)
- On Field Size and Success Probability in Network Coding (Q3519560) (← links)
- Some applications of finite geometry for secure network coding (Q3537421) (← links)
- Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization (Q3540932) (← links)
- Secure Error-Correction Network Coding in a Randomized Setting (Q3634339) (← links)
- Interactive Communication, Diagnosis and Error Control in Networks (Q3637318) (← links)
- Network information flow (Q4501758) (← links)
- Finite Dynamical Systems, Hat Games, and Coding Theory (Q4578011) (← links)
- Linearly Homomorphic Signatures with Designated Entities (Q5056030) (← links)
- Subspace codes from Ferrers diagrams (Q5272572) (← links)
