Finding codes on infinite grids automatically
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911572384808960 |
|---|---|
| author | Salo, Ville Törmä, Ilkka |
| author_facet | Salo, Ville Törmä, Ilkka |
| contents | We apply automata theory and Karp's minimum mean weight cycle algorithm to minimum density problems in coding theory. Using this method, we find the new upper bound $53/126 \approx 0.4206$ for the minimum density of an identifying code on the infinite hexagonal grid, down from the previous record of $3/7 \approx 0.4286$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2303_00557 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Finding codes on infinite grids automatically Salo, Ville Törmä, Ilkka Combinatorics Discrete Mathematics Formal Languages and Automata Theory Dynamical Systems G.2.1 We apply automata theory and Karp's minimum mean weight cycle algorithm to minimum density problems in coding theory. Using this method, we find the new upper bound $53/126 \approx 0.4206$ for the minimum density of an identifying code on the infinite hexagonal grid, down from the previous record of $3/7 \approx 0.4286$. |
| title | Finding codes on infinite grids automatically |
| topic | Combinatorics Discrete Mathematics Formal Languages and Automata Theory Dynamical Systems G.2.1 |
| url | https://arxiv.org/abs/2303.00557 |