Capacity of Hexagonal Checkerboard Codes
Zhun Deng, Jie Ding, Mohammad Noshad, and Vahid Tarokh
TL;DR
This paper introduces a new method to derive tighter capacity bounds for checkerboard codes on the hexagonal lattice, enhancing the understanding of their theoretical limits.
Contribution
It presents a novel bounding technique that improves upon existing bounds for the capacity of hexagonal checkerboard codes.
Findings
Tighter capacity bounds than previous methods
Rigorous mathematical bounds established
Enhanced understanding of code capacity limits
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · DNA and Biological Computing · Coding theory and cryptography