Network coding for line networks with broadcast channels
type: Item
instance of: scholarly article
title: Network coding for line networks with broadcast channels
zbMATH Open document ID: 1305.94025
author: Gerhard Kramer
author: Seyed Mohammadsadegh Tabatabaei Yazdi
published in: Entropy
publication date: 2014-09-08T00:00:00Z
review text: Summary: An achievable rate region for line networks with edge and node capacity constraints and broadcast channels (BCs) is derived. The region is shown to be the capacity region if the BCs are orthogonal, deterministic, physically degraded, or packet erasure with one-bit feedback. If the BCs are physically degraded with additive Gaussian noise then independent Gaussian inputs achieve capacity.
Mathematics Subject Classification ID: 94A29
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 6341042
zbMATH Keywords: broadcast channels
zbMATH Keywords: capacity
zbMATH Keywords: network coding
zbMATH Keywords: relay channels
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.3390/e14101813
OpenAlex ID: W2020821134
cites work: Capacity results for the discrete memoryless network
cites work: Network Coding in Node-Constrained Line and Star Networks
cites work: Rate Regions for Relay Broadcast Channels
cites work: Broadcast channels
cites work: The feedback capacity of degraded broadcast channels (Corresp.)
cites work: A proof of Marton's coding theorem for the discrete memoryless broadcast channel (Corresp.)
cites work: On the Capacity of 1-to-$K$ Broadcast Packet Erasure Channels With Channel Output Feedback
cites work: The capacity of the white Gaussian multiple access channel with feedback
cites work: Wireless Network Information Flow: A Deterministic Approach
cites work: Noisy Network Coding
DOI: 10.3390/E14101813
description: scientific article; zbMATH DE number 6341042