On Vertex Identifying Codes For Infinite Lattices
Brendon Stanton
TL;DR
This thesis explores vertex identifying codes in infinite lattices, providing bounds and improvements for various grid structures, advancing understanding of code efficiency in infinite graph models.
Contribution
It compiles and extends prior research on identifying codes in infinite grids, offering new bounds and methods for different lattice types.
Findings
Established lower bounds for identifying codes in certain infinite grids
Improved bounds for r-identifying codes in the hex grid
Extended results to n-dimensional lattices
Abstract
PhD Thesis--A compilation of the papers: "Lower Bounds for Identifying Codes in Some Infinite Grids", "Improved Bounds for r-identifying Codes of the Hex Grid", and "Vertex Identifying Codes for the n-dimensional Lattics" along with some other results
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
TopicsCoding theory and cryptography · semigroups and automata theory · Cellular Automata and Applications