(Secure) linear network coding multicast
type: Item
instance of: scholarly article
title: (Secure) linear network coding multicast
zbMATH Open document ID: 1375.94177
author: Christina Fragouli
author: Emina Soljanin
published in: Designs, Codes and Cryptography
publication date: 2016-02-02T00:00:00Z
review text: Network coding has been studied within a lot of different theoretical frameworks. It is an interesting mathematical technique introduced by Ahlswede, Cai, Li, and Yeung in their paper ``Network information flow'' at the turn of the millenium [\textit{R. Ahlswede} et al., IEEE Trans. Inf. Theory 46, No. 4, 1204--1216 (2000; Zbl 0991.90015)]. In this paper, the authors introduce network coding through an algebraic and combinatorial framework.They present the connections with classical coding theory and point out a selection of emerging areas and long-time open questions.
Mathematics Subject Classification ID: 94B99
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 6538699
zbMATH Keywords: network coding
zbMATH Keywords: classical coding
zbMATH Keywords: MDS codes
zbMATH Keywords: multicast
zbMATH Keywords: deterministic networks
reviewed by: Zlatko Varbanov
MaRDI profile type: Publication
full work available at URL: s10623-015-0155-6
OpenAlex ID: W2224360947
cites work: Network information flow
cites work: Q4633867
cites work: Wireless Network Information Flow: A Deterministic Approach
cites work: Frank Miller: Inventor of the One-Time Pad
cites work: Q3097395
cites work: Secure Network Coding on a Wiretap Network
cites work: Performance Bounds on a Wiretap Network With Arbitrary Wiretap Sets
cites work: Secrecy Capacities for Multiterminal Channel Models
cites work: On Secure Network Coding With Nonuniform or Restricted Wiretap Sets
cites work: Secret Communication Over Broadcast Erasure Channels With State-Feedback
cites work: Secure Network Coding With Erasures and Feedback
cites work: Algebraic Algorithms for Vector Network Coding
cites work: Combinatiorial algorithms for wireless information flow
cites work: Secure Network Coding for Wiretap Networks of Type II
cites work: Information flow decomposition for network coding
cites work: Binomial determinants, paths, and hook length formulae
cites work: The Gaussian wire-tap channel
cites work: Information Theoretic Security
cites work: Secret key agreement by public discussion from common information
cites work: Q3374920
cites work: Wire-Tap Channel II
cites work: Communication Theory of Secrecy Systems*
cites work: Determinants of Commuting-Block Matrices
cites work: A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks
cites work: The Wire-Tap Channel
DOI: 10.1007/S10623-015-0155-6
description: scientific article; zbMATH DE number 6538699