Resource allocation from the perspective of channel coding

This paper is motivated by a need to optimize resource allocation, which has applications in many fields, including communications, industrial engineering, and task management. Our proposed solution exploits Shannon's Channel Coding Theorem, whereby the problem of resource allocation is formulated as a bipartite graph. Specifically, we show that a subclass of resource allocation problem, i.e., zero-one allocation problem, can be mapped into classical channel coding theory for noisy channels. The results are presented within the realm of graph theory. We hope this work will renew the interest of applying information theory in multidisciplinary research.