• DocumentCode
    86374
  • Title

    Linear Codes, Target Function Classes, and Network Computing Capacity

  • Author

    Appuswamy, Rathinakumar ; Franceschetti, Massimo ; Karamchandani, Nikhil ; Zeger, Kenneth

  • Author_Institution
    IBM Res. Almaden, San Jose, CA, USA
  • Volume
    59
  • Issue
    9
  • fYear
    2013
  • fDate
    Sept. 2013
  • Firstpage
    5741
  • Lastpage
    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
    linear codes; nonlinear codes; capacity bound; linear code; linear target function; network code; network computing capacity; nonlinear coding; reducible target function; routing; semiinjective target function; single-receiver network; target function class; Decoding; Linear code; Network coding; Receivers; Routing; Vectors; Capacity; cut-set bound; function computation; information theory; network coding;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2013.2252052
  • Filename
    6476724
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=86374