Research

My research includes various topics in information theory, coding theory, and cryptography. I am generally interested in the mathematical foundations and computational/algorithmic aspects of these and related subjects, as well as in their applications.

All publications listed below can be downloaded from my arXiv or ResearchGate webpages.
Other research profiles:   Google Scholar, ORCiD, Web of Science, Scopus, IEEE, dblp, CSAuthors, zbMATH.

Preprints

1. Keshav Goyal, Mladen Kovačević, and Han Mao Kiah,
   Codes Correcting Transpositions of Consecutive Characters,
   in preparation.

2. Mladen Kovačević, Darko Čapko, Nemanja Nedić, and Srđan Vukmirović,
   On the Commitment Capacity of Discrete Memoryless Channels,
   Oct. 2024.

3. Patrik Velčický, Jakub Breier, Mladen Kovačević, and Xiaolu Hou,
   DeepNcode: Encoding-Based Protection against Bit-Flip Attacks on Neural Networks,
   May 2024.

Journal Papers

1. Keshav Goyal, Duc Tu Dao, Mladen Kovačević, and Han Mao Kiah,
   Gilbert–Varshamov Bound for Codes in L₁ Metric using Multivariate Analytic Combinatorics,
   

   IEEE Transactions on Information Theory, vol. 71, no. , pp. –, 2025.

2. Mladen Kovačević,
   Vector Multispaces and Multispace Codes,
   Applied Mathematics and Computation, 486, 129041, 2025.

3. Mladen Kovačević, Iosif Pinelis, and Marios Kountouris,
   An Information-Theoretic Analog of the Twin Paradox,
   Europhysics Letters (EPL), 146 (4), 42002, 2024.

4. Xiaolu Hou, Jakub Breier, and Mladen Kovačević,
   Another Look at Side-Channel Resistant Encoding Schemes,
   IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 32 (8), 1559–1563, 2024.

5. Mladen Kovačević,
   Lattice Packings of Cross-polytopes from Reed–Solomon Codes and Sidon Sets,
   Bulletin of the London Mathematical Society, 54 (6), 2372–2378, 2022.

6. Mladen Kovačević,
   On the Maximum Number of Non-Confusable Strings Evolving under Short Tandem Duplications,
   Problems of Information Transmission, 58 (2), 111–121, 2022.

7. Mladen Kovačević and Dejan Vukobratović,
   Asymptotic Behavior and Typicality Properties of Runlength-Limited Sequences,
   IEEE Transactions on Information Theory, 68 (3), 1638–1650, 2022.

8. Mladen Kovačević,
   Abelian Difference Sets as Lattice Coverings and Lattice Tilings,
   Bulletin of the Australian Mathematical Society, 106 (2), 177–184, 2022.

9. Mladen Kovačević,
   On the Maximum Entropy of a Sum of Independent Discrete Random Variables,
   Theory of Probability and Its Applications, 66 (3), 482–487, 2021.

10. Mladen Kovačević,
    Signaling to Relativistic Observers: An Einstein–Shannon–Riemann Encounter,
    Problems of Information Transmission, 56 (4), 303–308, 2020.

11. Yuta Sakai, Vincent Y. F. Tan, and Mladen Kovačević,
    Second- and Third-Order Asymptotics of the Continuous-Time Poisson Channel,
    IEEE Transactions on Information Theory, 66 (8), 4742–4760, 2020.

12. Mladen Kovačević,
    Zero-Error Capacity of Duplication Channels,
    IEEE Transactions on Communications, 67 (10), 6735–6742, 2019.

13. Mladen Kovačević,
    Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis,
    IEEE Transactions on Information Theory, 65 (8), 4804–4814, 2019.

14. Mladen Kovačević, Carol Wang, and Vincent Y. F. Tan,
    Fundamental Limits of Communication Over State-Dependent Channels with Feedback,
    IEEE Transactions on Communications, 67 (5), 3182–3191, 2019.

15. Mladen Kovačević and Vincent Y. F. Tan,
    Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems,
    IEEE Communications Letters, 22 (11), 2194–2197, 2018.

16. Mladen Kovačević and Vincent Y. F. Tan,
    Codes in the Space of Multisets—Coding for Permutation Channels with Impairments,
    IEEE Transactions on Information Theory, 64 (7), 5156–5169, 2018.

17. Mladen Kovačević, Miloš Stojaković, and Vincent Y. F. Tan,
    Zero-Error Capacity of P-ary Shift Channels and FIFO Queues,
    IEEE Transactions on Information Theory, 63 (12), 7698–7707, 2017.

18. Mladen Kovačević,
    A Note on Parallel Asynchronous Channels with Arbitrary Skews,
    IEEE Transactions on Information Theory, 63 (11), 7320–7321, 2017.

19. Mladen Kovačević and Vincent Y. F. Tan,
    Improved Bounds on Sidon Sets via Lattice Packings of Simplices,
    SIAM Journal on Discrete Mathematics, 31 (3), 2269–2278, 2017.

20. Mladen Kovačević,
    On Error Detection in Asymmetric Channels,
    IEEE Communications Letters, 21 (9), 1933–1936, 2017.

21. Mladen Kovačević and Dejan Vukobratović,
    Perfect Codes in the Discrete Simplex,
    Designs, Codes and Cryptography, 75 (1), 81–95, 2015.

22. Mladen Kovačević, Ivan Stanojević, and Vojin Šenk,
    On the Entropy of Couplings,
    Information and Computation, 242, 369–382, 2015.

23. Mladen Kovačević, Ivan Stanojević, and Vojin Šenk,
    Information-Geometric Equivalence of Transportation Polytopes,
    Problems of Information Transmission, 51 (2), 103–109, 2015.

24. Mladen Kovačević and Petar Popovski,
    Zero-Error Capacity of a Class of Timing Channels,
    IEEE Transactions on Information Theory, 60 (11), 6796–6800, 2014.

25. Mladen Kovačević and Dejan Vukobratović,
    Subset Codes for Packet Networks,
    IEEE Communications Letters, 17 (4), 729–732, 2013.

26. Mladen Kovačević, Ivan Stanojević, and Vojin Šenk,
    Some Properties of Rényi Entropy over Countably Infinite Alphabets,
    Problems of Information Transmission, 49 (2), 99–110, 2013.

27. Mladen Kovačević and Vojin Šenk,
    On Possible Dependence Structures of a Set of Random Variables,
    Acta Mathematica Hungarica, 135 (3), 286–296, 2012.

Conference Papers

1. Keshav Goyal, Duc Tu Dao, Han Mao Kiah, and Mladen Kovačević,
   Evaluation of the Gilbert–Varshamov Bound using Multivariate Analytic Combinatorics,
   Proc. IEEE International Symposium on Information Theory (ISIT), pp. 2458–2463, Taipei, Taiwan, June 2023.
   Extended version: J27

2. Mladen Kovačević and Dejan Vukobratović,
   Optimal Error-Detecting Codes for General Asymmetric Channels via Sperner Theory,
   Proc. IEEE Information Theory Workshop (ITW), pp. 636–641, Mumbai, India, Nov. 2022.

3. Mladen Kovačević and Dejan Vukobratović,
   Asymptotics of Constant-Weight Constrained Sequences with Applications,
   Proc. IEEE Information Theory Workshop (ITW), 6 p., Kanazawa, Japan (virtual event), Oct. 2021.
   Extended version: J21

4. Yuta Sakai, Mladen Kovačević, and Vincent Y. F. Tan,
   Second-Order Asymptotics of the Continuous-Time Poisson Channel,
   Proc. IEEE Information Theory Workshop (ITW), 5 p., Visby, Gotland, Sweden, Aug. 2019.
   Extended version: J17

5. Mladen Kovačević, Sanja Brdar, and Vladimir Crnojević,
   Some Enumeration Problems in the Duplication-Loss Model of Genome Rearrangement,
   Proc. IEEE International Symposium on Information Theory (ISIT), pp. 927–931, Paris, France, July 2019.

6. Mladen Kovačević,
   Bounds on Codes for the Bit-Shift Channel with (d,k)-Constrained Inputs,
   Proc. IEEE International Symposium on Information Theory (ISIT), pp. 1587–1591, Paris, France, July 2019.
   Extended version: J15

7. Carol Wang, Mladen Kovačević, and Vincent Y. F. Tan,
   Error-Free Communication Over State-Dependent Channels with Variable-Length Feedback,
   Proc. IEEE International Symposium on Information Theory (ISIT), pp. 286–290, Vail, CO, USA, June 2018.
   Extended version: J14

8. Mladen Kovačević and Vincent Y. F. Tan,
   Coding for the Permutation Channel with Insertions, Deletions, Substitutions, and Erasures,
   Proc. IEEE International Symposium on Information Theory (ISIT), pp. 1933–1937, Aachen, Germany, June 2017.
   Extended version: J12

9. Mladen Kovačević, Ivan Stanojević, and Vojin Šenk,
   On the Hardness of Entropy Minimization and Related Problems,
   Proc. IEEE Information Theory Workshop (ITW), pp. 512–516, Lausanne, Switzerland, Sept. 2012.
   Extended version: J6

Book Chapters

1. Ivan Stanojević, Mladen Kovačević, and Vojin Šenk,
   Application of Maxeler DataFlow Supercomputing to Spherical Code Design,
   in: Veljko Milutinović and Miloš Kotlar (eds.), Exploring the DataFlow Supercomputing Paradigm, pp. 133–168, Springer, 2019.