Autor: |
Dereniowski, Dariusz, Jurkiewicz, Marcin |
Předmět: |
|
Zdroj: |
IEEE Transactions on Information Theory; Jun2021, Vol. 67 Issue 6, p3818-3823, 6p |
Abstrakt: |
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. [ABSTRACT FROM AUTHOR] |
Databáze: |
Complementary Index |
Externí odkaz: |
|