Capacity of Hexagonal Checkerboard Codes
classification
💻 cs.IT
math.IT
keywords
capacitycheckerboardcodeshexagonalboundboundscommonlyknown
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.