Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics
arXiv:2305.04439 · doi:10.1109/ISIT54713.2023.10206902
Abstract
Analytic combinatorics in several variables refers to a suite of tools that provide sharp asymptotic estimates for certain combinatorial quantities. In this paper, we apply these tools to determine the Gilbert-Varshamov (GV) bound for the sticky insertion and the constrained-synthesis channel.
References in corpus (5)
- Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems
- Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis
- Asymptotic Behavior and Typicality Properties of Runlength-Limited Sequences
- Multivariate Analytic Combinatorics for Cost Constrained Channels
- Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics