Deterministic network coding by matrix completion
From MaRDI portal
Recommendations
- Fast deterministic algorithms for matrix completion problems
- Fast deterministic algorithms for matrix completion problems
- Deterministic polynomial time algorithms for matrix completion problems
- Randomized and deterministic algorithms for network coding problems in wireless networks
- Polynomial Time Algorithms for Multicast Network Code Construction
Cited in
(23)- Random network coding over composite fields
- The \(b\)-branching problem in digraphs
- Dynamic matrix rank with partial lookahead
- Multicast triangular semilattice network
- Fundamental conditions on the sampling pattern for union of low-rank subspaces retrieval
- Generalized Wong sequences and their applications to Edmonds' problems
- Non-commutative Edmonds' problem and matrix semi-invariants
- Randomized and deterministic algorithms for network coding problems in wireless networks
- Multicasting in Linear Deterministic Relay Network by Matrix Completion
- On Field Size and Success Probability in Network Coding
- Polynomial-Time Construction of Linear Network Coding
- Information flow decomposition for network coding
- Polynomial Time Algorithms for Multicast Network Code Construction
- Rank determination for low-rank data completion
- Fast deterministic algorithms for matrix completion problems
- Union of low-rank tensor spaces: clustering and completion
- Fast deterministic algorithms for matrix completion problems
- scientific article; zbMATH DE number 7378329 (Why is no real title available?)
- Finding a low-rank basis in a matrix subspace
- Deterministic polynomial time algorithms for matrix completion problems
- Matrix structure and loss-resilient encoding/decoding
- Dynamic matrix rank
- Evolutionary algorithms and matroid optimization problems
This page was built for publication: Deterministic network coding by matrix completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921704)
