Entropy and Counting

  • Radhakrishnan J
  • 41

    Readers

    Mendeley users who have this article in their library.
  • N/A

    Citations

    Citations of this article.

Abstract

We illustrate the role of information theoretic ideas in combinatorial problems, some of them arising in computer science. We also consider the problem of covering graphs using other graphs, and show how information theoretic ideas are applied to this setting. Our treatment of graph covering problems naturally motivates two (already known) definitions of K ̈orner’s graph entropy.

Author-supplied keywords

  • counting problems
  • covering problems
  • graph entropy
  • shannon entropy

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

There are no full text links

Authors

  • Jaikumar Radhakrishnan

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free