(Secure) linear network coding multicast
From MaRDI portal
Publication:908052
DOI10.1007/s10623-015-0155-6zbMath1375.94177OpenAlexW2224360947MaRDI QIDQ908052
Christina Fragouli, Emina Soljanin
Publication date: 2 February 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0155-6
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items
Almost affinely disjoint subspaces and covering Grassmannian codes ⋮ Algebraic codes for network coding
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Binomial determinants, paths, and hook length formulae
- Determinants of Commuting-Block Matrices
- Frank Miller: Inventor of the One-Time Pad
- Combinatiorial algorithms for wireless information flow
- Secret Communication Over Broadcast Erasure Channels With State-Feedback
- Secure Network Coding With Erasures and Feedback
- Performance Bounds on a Wiretap Network With Arbitrary Wiretap Sets
- On Secure Network Coding With Nonuniform or Restricted Wiretap Sets
- Information flow decomposition for network coding
- Information Theoretic Security
- Secrecy Capacities for Multiterminal Channel Models
- Communication Theory of Secrecy Systems*
- The Wire-Tap Channel
- The Gaussian wire-tap channel
- Secret key agreement by public discussion from common information
- Network information flow
- Secure Network Coding for Wiretap Networks of Type II
- A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks
- Wireless Network Information Flow: A Deterministic Approach
- Algebraic Algorithms for Vector Network Coding
- Secure Network Coding on a Wiretap Network
- Wire-Tap Channel II
