Deterministic Network Model Revisited: An Algebraic Network Coding Approach
Name
1103.0999.pdf
Description
Submitted version
Size
706.25 KB
Format
Adobe PDF
Checksum (MD5)
219716b83f0430fc15c6d34818066c9d
Author(s)
Erez, Elona
Kim, MinJi
Xu, Yun
Yeh, Edmund M.
Medard, Muriel
Date Issued
June 2014
Journal
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Erez, Elona et al. "Deterministic Network Model Revisited: An Algebraic Network Coding Approach" IEEE Transactions on Information Theory 60, 8 (June 2014): 4867-4879 © Copyright 2019 IEEE
Version
Original manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/tit.2014.2329840
