Deterministic Network Model Revisited: An Algebraic Network Coding Approach

The capacity of multiuser networks has been a long-standing problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to approximate multiuser wireless networks. This model, known as the ADT network model, takes into account the broadcast nature as well a...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 60; no. 8; pp. 4867 - 4879
Main Authors: Erez, Elona, MinJi Kim, Yun Xu, Yeh, Edmund M., Medard, Muriel
Format: Journal Article Conference Proceeding
Language:English
Published: New York, NY IEEE 01.08.2014
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Additives
Algebra
Applied sciences
Approximation
Coding
Coding, codes
Construction
Encoding
Exact sciences and technology
Information theory
Information, signal and communications theory
Interference
Invariants
Joints
Multicast communication
Network coding
Networks
Ports (Computers)
Signal and communications theory
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Vectors
Wireless communication
Wireless networks
deterministic network
algebraic coding
Network coding
code construction
multicast
non-multicast
Multiple access
Packet switching
Relay network
Wireless telecommunication
Algebraic code
Data broadcast
Information dissemination
Multicast
Linear code
Deterministic model
Algebraic method
Wireless network
Deterministic approach
Information theory
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The capacity of multiuser networks has been a long-standing problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to approximate multiuser wireless networks. This model, known as the ADT network model, takes into account the broadcast nature as well as the multiuser interference inherent in the wireless medium. For the types of connections we consider, we show that the results of Avestimehr et al. under the ADT model can be reinterpreted within the algebraic network coding framework introduced by Koetter and Médard. Using this framework, we propose an efficient distributed linear code construction for the deterministic wireless multicast relay network model. Unlike several previous coding schemes, we do not attempt to find flows in the network. Instead, for a layered network, we maintain an invariant where it is required that at each stage of the code construction, certain sets of codewords are linearly independent.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2014.2329840