Capacity of Hexagonal Checkerboard Codes
arXiv:1506.02163
Abstract
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 known.
This manuscript has been withdrawn by the authors as they have some new progress and will rewrite it