Linear Codes, Target Function Classes, and Network Computing Capacity
Authors:
- 8 March 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 59 (9) , 5741-5753
Abstract
We study the use of linear codes for network computing in single-receiver networks with various classes of target functions of the source messages. Such classes include reducible, semi-injective, and linear target functions over finite fields. Computing capacity bounds and achievability are given with respect to these target function classes for network codes that use routing, linear coding, or nonlinear coding.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Network Coding for Computing: Cut-Set BoundsIEEE Transactions on Information Theory, 2011
- Zero-error function computation in sensor networks2009
- Network computing capacity for the reverse butterfly network2009
- Computation Over Multiple-Access ChannelsIEEE Transactions on Information Theory, 2007
- On the capacity of information networksIEEE Transactions on Information Theory, 2006
- Toward a theory of in-network computation in wireless sensor networksIEEE Communications Magazine, 2006
- Network routing capacityIEEE Transactions on Information Theory, 2006
- Insufficiency of Linear Coding in Network Information FlowIEEE Transactions on Information Theory, 2005
- An algebraic approach to network codingIEEE/ACM Transactions on Networking, 2003
- Linear network codingIEEE Transactions on Information Theory, 2003