• DocumentCode
    3663445
  • Title

    A method for the construction of optimal task encoders

  • Author

    Amos Lapidoth;Christoph Pfister

  • Author_Institution
    ETH Zurich, Switzerland
  • fYear
    2015
  • fDate
    6/1/2015 12:00:00 AM
  • Firstpage
    2540
  • Lastpage
    2544
  • Abstract
    An algorithm of polynomial complexity is proposed that produces an optimal task encoder for tasks that are generated according to some given law and that need to be described using a given number of labels. It thus minimizes the expectation (or ρ-th moment) of the number of tasks that share the label of a randomly-generated task.
  • Keywords
    "Heuristic algorithms","Entropy","Complexity theory","Cost function","Encoding","5G mobile communication"
  • Publisher
    ieee
  • Conference_Titel
    Information Theory (ISIT), 2015 IEEE International Symposium on
  • Electronic_ISBN
    2157-8117
  • Type

    conf

  • DOI
    10.1109/ISIT.2015.7282914
  • Filename
    7282914
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3663445