Capacity of Hexagonal Checkerboard Codes
Information Theory
2017-04-04 v2 math.IT
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.
Keywords
Cite
@article{arxiv.1506.02163,
title = {Capacity of Hexagonal Checkerboard Codes},
author = {Zhun Deng and Jie Ding and Mohammad Noshad and Vahid Tarokh},
journal= {arXiv preprint arXiv:1506.02163},
year = {2017}
}
Comments
This manuscript has been withdrawn by the authors as they have some new progress and will rewrite it