4 papers
Maximum Entropy of Sums of Independent Ternary Random Variables
Mladen Kovačević
The classical problem of maximizing the Shannon entropy of a sum of independent random variables supported on a finite alphabet is considered and settled in the ternary case. Namel…
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…
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…
Vector Multispaces and Multispace Codes
Mladen Kovačević
Basic algebraic and combinatorial properties of finite vector spaces in which individual vectors are allowed to have multiplicities larger than are derived. An application in…