2000 character limit reached
Capacity of Hexagonal Checkerboard Codes (1506.02163v2)
Published 6 Jun 2015 in cs.IT and 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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.