Back to Results
First PageMeta Content
Graph coloring / NP-complete problems / Cartesian product of graphs / Lovász number / Graph theory / Induced path / Degeneracy


Combinatorial Reasoning in Information Theory Noga Alon∗ Abstract Combinatorial techniques play a crucial role in the investigation of problems in Information Theory. We describe a few representative examples, focusing
Add to Reading List

Document Date: 2009-09-22 15:09:58


Open Document

File Size: 139,32 KB

Share Result on Facebook

City

Szeged / Budapest / /

Company

Wilson / Bell Laboratories / /

Country

Hungary / United States / /

/

Facility

Tel Aviv University / /

IndustryTerm

valid protocol / direct product / possible solution / memoryless systems / satellite communications / broadcast network / broadcast networks / information theoretic tools / graph products / /

Movie

Hide and seek / /

NaturalFeature

Shannon / /

Organization

Hermann Minkowski Minerva Center for Geometry / Israel Science Foundation / Sackler School of Mathematics / Mathematics and Blavatnik School of Computer Science / Beverly Sackler Faculty of Exact Sciences / Tel Aviv University / Tel Aviv / /

Person

Raymond Sackler / D. Ray-Chaudhuri / C. Berge / Beverly Sackler / /

/

Position

author / representative / /

ProgrammingLanguage

C / /

PublishedMedium

Pacific Journal of Mathematics / IEEE Transactions on Information Theory / /

Technology

valid protocol / Video on Demand / caching / same protocol / satellite communications / /

SocialTag