Evaluating the Gilbert-Varshamov Bound for Constrained Systems
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914696397848576 |
|---|---|
| author | Goyal, Keshav Kiah, Han Mao |
| author_facet | Goyal, Keshav Kiah, Han Mao |
| contents | We revisit the well-known Gilbert-Varshamov (GV) bound for constrained systems. In 1991, Kolesnik and Krachkovsky showed that GV bound can be determined via the solution of some optimization problem. Later, Marcus and Roth (1992) modified the optimization problem and improved the GV bound in many instances. In this work, we provide explicit numerical procedures to solve these two optimization problems and hence, compute the bounds. We then show the procedures can be further simplified when we plot the respective curves. In the case where the graph presentation comprise a single state, we provide explicit formulas for both bounds. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_18869 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Evaluating the Gilbert-Varshamov Bound for Constrained Systems Goyal, Keshav Kiah, Han Mao Information Theory Discrete Mathematics Combinatorics We revisit the well-known Gilbert-Varshamov (GV) bound for constrained systems. In 1991, Kolesnik and Krachkovsky showed that GV bound can be determined via the solution of some optimization problem. Later, Marcus and Roth (1992) modified the optimization problem and improved the GV bound in many instances. In this work, we provide explicit numerical procedures to solve these two optimization problems and hence, compute the bounds. We then show the procedures can be further simplified when we plot the respective curves. In the case where the graph presentation comprise a single state, we provide explicit formulas for both bounds. |
| title | Evaluating the Gilbert-Varshamov Bound for Constrained Systems |
| topic | Information Theory Discrete Mathematics Combinatorics |
| url | https://arxiv.org/abs/2402.18869 |