On Rényi Entropies Over Countably Infinite Alphabets - Mladen Kovacevic 001; Ivan Stanojevic; Vojin Senk (CoRR, 2011)

On the hardness of entropy minimization and related problems. - Mladen Kovacevic 001; Ivan Stanojevic; Vojin Senk (ITW, 2012)

Multiset Codes for Permutation Channels - Mladen Kovacevic 001; Dejan Vukobratovic (CoRR, 2013)

Subset Codes for Packet Networks. - Mladen Kovacevic 001; Dejan Vukobratovic (IEEE Commun. Lett., 2013)

Some properties of Rényi entropy over countably infinite alphabets. - Mladen Kovacevic 001; Ivan Stanojevic; Vojin Senk (Probl. Inf. Transm., 2013)

Difference Sets and Codes in $ A_n $ Lattices. - Mladen Kovacevic 001 (CoRR, 2014)

Zero-Error Capacity of a Class of Timing Channels. - Mladen Kovacevic 001; Petar Popovski (IEEE Trans. Inf. Theory, 2014)

Perfect codes in the discrete simplex. - Mladen Kovacevic 001; Dejan Vukobratovic (Des. Codes Cryptogr., 2015)

On the entropy of couplings. - Mladen Kovacevic 001; Ivan Stanojevic; Vojin Senk (Inf. Comput., 2015)

Information-geometric equivalence of transportation polytopes. - Mladen Kovacevic 001; Ivan Stanojevic; Vojin Senk (Probl. Inf. Transm., 2015)

Zero-Error Shift-Correcting and Shift-Detecting Codes. - Mladen Kovacevic 001; Milos Stojakovic; Vincent Y. F. Tan (CoRR, 2016)

Sidon Sets of Fixed Cardinality and Lattice-Packings of Simplices. - Mladen Kovacevic 001; Vincent Y. F. Tan (CoRR, 2016)

Coding for the permutation channel with insertions, deletions, substitutions, and erasures. - Mladen Kovacevic 001; Vincent Y. F. Tan (ISIT, 2017)

On Error Detection in Asymmetric Channels. - Mladen Kovacevic 001 (IEEE Commun. Lett., 2017)

Improved Bounds on Sidon Sets via Lattice Packings of Simplices. - Mladen Kovacevic 001; Vincent Y. F. Tan (SIAM J. Discret. Math., 2017)

A Note on Parallel Asynchronous Channels With Arbitrary Skews. - Mladen Kovacevic 001 (IEEE Trans. Inf. Theory, 2017)

Zero-Error Capacity of P-ary Shift Channels and FIFO Queues. - Mladen Kovacevic 001; Milos Stojakovic; Vincent Y. F. Tan (IEEE Trans. Inf. Theory, 2017)

Error-Free Communication Over State-Dependent Channels with Variable-Length Feedback. - Carol Wang; Mladen Kovacevic 001; Vincent Y. F. Tan (ISIT, 2018)

Runlength-Limited Sequences and Shift-Correcting Codes. - Mladen Kovacevic 001 (CoRR, 2018)

Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems. - Mladen Kovacevic 001; Vincent Y. F. Tan (IEEE Commun. Lett., 2018)

Codes in the Space of Multisets - Coding for Permutation Channels With Impairments. - Mladen Kovacevic 001; Vincent Y. F. Tan (IEEE Trans. Inf. Theory, 2018)

Some Enumeration Problems in the Duplication-Loss Model of Genome Rearrangement. - Mladen Kovacevic 001; Sanja Brdar; Vladimir S. Crnojevic (ISIT, 2019)

Bounds on Codes for the Bit-Shift Channel with (d, k)-Constrained Inputs. - Mladen Kovacevic 001 (ISIT, 2019)

Second-Order Asymptotics of the Continuous-Time Poisson Channel. - Yuta Sakai; Mladen Kovacevic 001; Vincent Y. F. Tan (ITW, 2019)

Codes Correcting All Patterns of Tandem-Duplication Errors of Maximum Length 3. - Mladen Kovacevic 001 (CoRR, 2019)

Zero-Error Capacity of Duplication Channels. - Mladen Kovacevic 001 (IEEE Trans. Commun., 2019)

Fundamental Limits of Communication Over State-Dependent Channels With Feedback. - Mladen Kovacevic 001; Carol Wang; Vincent Y. F. Tan (IEEE Trans. Commun., 2019)

Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis. - Mladen Kovacevic 001 (IEEE Trans. Inf. Theory, 2019)

On the Maximum Entropy of a Sum of Independent Discrete Random Variables. - Mladen Kovacevic 001 (CoRR, 2020)

Signaling to Relativistic Observers: An Einstein-Shannon-Riemann Encounter. - Mladen Kovacevic 001 (Probl. Inf. Transm., 2020)

Second- and Third-Order Asymptotics of the Continuous-Time Poisson Channel. - Yuta Sakai; Vincent Y. F. Tan; Mladen Kovacevic 001 (IEEE Trans. Inf. Theory, 2020)

Asymptotics of Constant-Weight Constrained Sequences with Applications. - Mladen Kovacevic 001; Dejan Vukobratovic (ITW, 2021)

Lattice Packings of Cross-polytopes Constructed from Sidon Sets. - Mladen Kovacevic 001 (CoRR, 2021)

Optimal Error-Detecting Codes for General Asymmetric Channels via Sperner Theory. - Mladen Kovacevic 001; Dejan Vukobratovic (ITW, 2022)

On the Maximum Number of Non-Confusable Strings Evolving under Short Tandem Duplications. - Mladen Kovacevic 001 (Probl. Inf. Transm., 2022)

Asymptotic Behavior and Typicality Properties of Runlength-Limited Sequences. - Mladen Kovacevic 001; Dejan Vukobratovic (IEEE Trans. Inf. Theory, 2022)

Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics. - Keshav Goyal; Duc Tu Dao; Han Mao Kiah; Mladen Kovacevic 001 (ISIT, 2023)

An Information-Theoretic Analog of the Twin Paradox. - Mladen Kovacevic 001; Iosif Pinelis; Marios Kountouris (CoRR, 2023)

Gilbert-Varshamov Bound for Codes in L1 Metric using Multivariate Analytic Combinatorics. - Keshav Goyal; Duc Tu Dao; Mladen Kovacevic 001; Han Mao Kiah (CoRR, 2024)

DeepNcode: Encoding-Based Protection against Bit-Flip Attacks on Neural Networks. - Patrik Velcický; Jakub Breier; Mladen Kovacevic 001; Xiaolu Hou (CoRR, 2024)

Another Look at Side-Channel-Resistant Encoding Schemes. - Xiaolu Hou; Jakub Breier; Mladen Kovacevic 001 (IEEE Trans. Very Large Scale Integr. Syst., 2024)

Vector multispaces and multispace codes. - Mladen Kovacevic 001 (Appl. Math. Comput., 2025)

A Zero-Knowledge Proof for the Syndrome Decoding Problem in the Lee Metric. - Mladen Kovacevic 001; Tatjana Grbic; Darko Capko; Nemanja Nedic; Srdan Vukmirovic (IACR Cryptol. ePrint Arch., 2025)

Gilbert-Varshamov Bound for Codes in L₁ Metric Using Multivariate Analytic Combinatorics. - Keshav Goyal; Duc Tu Dao; Mladen Kovacevic 001; Han Mao Kiah (IEEE Trans. Inf. Theory, 2025)

A Zero-Knowledge Proof for the Syndrome Decoding Problem in the Lee Metric. - Mladen Kovacevic 001; Tatjana Grbic; Darko Capko; Nemanja Nedic; Srdjan Vukmirovic (CoRR, 2025)