1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.IT2015
Capacity of Hexagonal Checkerboard Codes
Zhun Deng, Jie Ding, Mohammad Noshad +1
In this paper, we propose a new method to bound the capacity of checkerboard codes on the hexagonal lattice. This produces rigorous bounds that are tighter than those commonly know…
cs.IT2015★ 1 cited
The Number of Independent Sets in Hexagonal Graphs
Zhun Deng, Jie Ding, Mohammad Noshad +1
A new method is proposed to derive rigorous bounds on η, the growth rate of the logarithm of the number of independent sets on a hexagonal lattice. Specifically, we prove that 1.54…