Polymatroidal Structure In The Multiple Access Channel With General Message Sets
2015 IEEE International Symposium on Information Theory (ISIT)(2015)
摘要
The conditions which govern reliable communication over networks are often given as a union of polyhedra. As increasingly larger networks are considered, these conditions become unwieldy and intractable, unless useful structure can be found in them. An example of a polyhedron with a useful underlying structure is a polymatroid, which despite its exponential number of defining inequalities, has a simple and explicit formula for its vertices. For the multiple access channel with general message sets, we show that each capacity characterization in a large class of capacity characterizations involves polymatroids.
更多查看译文
关键词
reliable communication,polyhedron,polymatroid,vertices,multiple access channel,general message sets
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要