Graph Guessing Games and Non-Shannon Information Inequalities.
- Submitting institution
-
Queen Mary University of London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 402
- Type
- D - Journal article
- DOI
-
10.1109/TIT.2016.2628819
- Title of journal
- IEEE Trans. Information Theory
- Article number
- 7
- First page
- 4257
- Volume
- 63
- Issue
- 7
- ISSN
- 0018-9448
- Open access status
- Compliant
- Month of publication
- November
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- "A paper relevant to a small exclusive community of approximately 100 researchers that are actively doing basic research in Information Theory. Each year the most prestigious venue ""Transactions on Information Theory"" publishes a few theoretical papers in this domain. Our paper provides the FIRST example of a combinatorial problem with bounds that CANNOT be derived from Shannon’s classical laws of information theory.
The paper is the key output from a research project involving three postdocs and a PhD student. I presented this work at an invited lecture series at the Henri Poincare Institute, Paris 2016 (https://www.youtube.com/watch?v=1qah_tZbYqg&index=44&list=PL9kd4mpdvWcAHARq6A-_tGxBIME31BVep)"
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -