4 papers
Bounds on Codes Correcting Adjacent Transpositions
Mladen Kovačević, Han Mao Kiah, Keshav Goyal
We study the problem of correcting pairwise disjoint adjacent transpositions (or swaps) in -ary strings. Equivalently, the model we assume is the radius-one instance of the so-c…
Evaluating the Gilbert-Varshamov Bound for Constrained Systems
Keshav Goyal, Han Mao Kiah
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 op…
Gilbert-Varshamov Bound for Codes in Metric using Multivariate Analytic Combinatorics
Keshav Goyal, Duc Tu Dao, Mladen Kovačević +1
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 t…
Sequence Reconstruction Problem for Deletion Channels: A Complete Asymptotic Solution
Van Long Phuoc Pham, Keshav Goyal, Han Mao Kiah
Transmit a codeword , that belongs to an -deletion-correcting code of length , over a -deletion channel for some . Levenshtein, in 2001, propos…