Secure Error-Correction Network Coding in a Randomized Setting
From MaRDI portal
Recommendations
Cites work
- Byzantine Modification Detection in Multicast Networks With Random Network Coding
- Coding for Errors and Erasures in Random Network Coding
- Linear network coding
- Linear Network Error Correction Codes in Packet Networks
- Network error correction. I: Basic concepts and upper bounds
- Network error correction. II: Lower bounds
- Network information flow
- Resilient Network Coding in the Presence of Byzantine Adversaries
- Secure Network Coding on a Wiretap Network
Cited in
(14)- Secure network coding for multiple unicast: on the case of single source
- Universal secure rank-metric coding schemes with optimal communication overheads
- Anonymous coherent network coding against eavesdropping and jamming
- Randomized component based secure secret reconstruction in insecure networks
- Secure N-dimensional simultaneous dense coding and applications
- An efficient construction of secure network coding
- scientific article; zbMATH DE number 4179283 (Why is no real title available?)
- Some applications of finite geometry for secure network coding
- Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization
- Information security in a random network coding network
- On Randomized Linear Network Codes and Their Error Correction Capabilities
- A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy
- Secure Erasure Codes With Partial Reconstructibility
- Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruption
This page was built for publication: Secure Error-Correction Network Coding in a Randomized Setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3634339)
