Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications

DOI10.1109/TIT.2011.2155618zbMath1365.94557arXiv1010.2619OpenAlexW2151919492MaRDI QIDQ5272296

Maximilien Gadouleau, Søren Riis

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.2619

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Other game-theoretic models (91A40) Measures of information, entropy (94A17) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20) Cyclic codes (94B15)

Related Items

Complexity of fixed point counting problems in Boolean networks ⋮ Fixed points in conjunctive networks and maximal independent sets in graph contractions ⋮ Guessing games on triangle-free graphs ⋮ Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory ⋮ Guessing numbers and extremal graph theory ⋮ Fast depth-based subgraph kernels for unattributed graphs ⋮ Finite Dynamical Systems, Hat Games, and Coding Theory ⋮ Bears with hats and independence polynomials ⋮ Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks ⋮ Attractor separation and signed cycles in asynchronous Boolean networks ⋮ On the influence of the interaction graph on a finite dynamical system ⋮ Hat guessing numbers of degenerate graphs ⋮ Positive and negative cycles in Boolean networks ⋮ The linear guessing number of undirected graphs ⋮ Guessing numbers of odd cycles ⋮ Expansive automata networks ⋮ On the stability and instability of finite dynamical systems with prescribed interaction graphs ⋮ Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules ⋮ The hat guessing number of graphs ⋮ New Constructions and Bounds for Winkler's Hat Game ⋮ Hat problem: a new strategy based on quantum stabilizer codes

This page was built for publication: Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications