6 papers
On the degradations of Binary-Input Discrete Memoryless Channels
Yadong Jiao, Xiaoyan Cheng, Yuansheng Tang +1
For the polar codes introduced by Arikan in 2009, the first code family achieving the capacity of binary-input discrete memoryless channels (BIDMCs) with low-complexity encoding an…
On the Arikan Transformations of Binary-Input Discrete Memoryless Channels
Yadong Jiao, Xiaoyan Cheng, Yuansheng Tang +1
The polar codes introduced by Arikan in 2009 achieve the capacity of binary-input discrete memoryless channels (BIDMCs) with low complexity encoding and decoding. Identifying the u…
On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels
Yadong Jiao, Xiaoyan Cheng, Yuansheng Tang +1
Polar codes introduced by Arikan in 2009 are the first code family achieving the capacity of binary-input discrete memoryless channels (BIDMCs) with low-complexity encoding and dec…
Girth of the algebraic bipartite graph
Ming Xu, Xiaoyan Cheng, Yuansheng Tang
For integer and prime power , the algebraic bipartite graph proposed by Lazebnik and Ustimenko (1995) is meaningful not only in extremal graph theory but also…
On the girth cycles of the bipartite graph
Ming Xu, Xiaoyan Cheng, Yuansheng Tang
For integer and prime power , the algebraic bipartite graph proposed by Lazebnik and Ustimenko (1995) is meaningful not only in extremal graph theory but also…
On a Generalization of the Bipartite Graph
Xiaoyan Cheng, Yuansheng Tang, Huaxiong Wang
In this paper, we deal with a generalization of the bipartite graphs proposed by Lazebnik and Ustimenko, where is a set of binary sequences that are adopted t…