Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics

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 (3)

• 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

Cited by in corpus (2)

• Gilbert-Varshamov Bound for Codes in $L_1$ Metric using Multivariate Analytic Combinatorics
• Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics