2 papers
cs.IT2026
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…
cs.IT2026
Bounds on Codes Correcting Adjacent Transpositions
Mladen KovaÄeviÄ, Mladen Kovačević, Keshav Goyal +1
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…