On the Characteristic Graph of a Discrete Symmetric Channel
IEEE Transactions on Information Theory(2021)
摘要
We present some characterizations of characteristic graphs of row and/or column symmetric channels. We also give a polynomial-time algorithm that decides whether there exists a discrete symmetric channel whose characteristic graph is equal to a given input graph. In addition, we show several applications of our results.
更多查看译文
关键词
Monte Carlo methods,Symmetric matrices,Standards,Channel coding,Polar codes,Memoryless systems,Complexity theory
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要