Mladen Kovacevic

Orcid: 0000-0002-2395-7628

Affiliations:
  • University of Novi Sad, Serbia
  • National University of Singapore, Electrical & Computer Engineering, Singapore (former)
  • University of Novi Sad, Serbia (PhD 2014)


According to our database1, Mladen Kovacevic authored at least 43 papers between 2011 and 2025.

Collaborative distances:

Timeline

2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
8
2
3
1
2
1
3
4
3
4
2
3
2
3
1
1
1
1
3
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Gilbert-Varshamov Bound for Codes in L₁ Metric Using Multivariate Analytic Combinatorics.
IEEE Trans. Inf. Theory, January, 2025

Vector multispaces and multispace codes.
Appl. Math. Comput., 2025

2024
Another Look at Side-Channel-Resistant Encoding Schemes.
IEEE Trans. Very Large Scale Integr. Syst., August, 2024

DeepNcode: Encoding-Based Protection against Bit-Flip Attacks on Neural Networks.
CoRR, 2024

Gilbert-Varshamov Bound for Codes in L<sub>1</sub> Metric using Multivariate Analytic Combinatorics.
CoRR, 2024

2023
An Information-Theoretic Analog of the Twin Paradox.
CoRR, 2023

Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Asymptotic Behavior and Typicality Properties of Runlength-Limited Sequences.
IEEE Trans. Inf. Theory, 2022

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

Optimal Error-Detecting Codes for General Asymmetric Channels via Sperner Theory.
Proceedings of the IEEE Information Theory Workshop, 2022

2021
Lattice Packings of Cross-polytopes Constructed from Sidon Sets.
CoRR, 2021

Asymptotics of Constant-Weight Constrained Sequences with Applications.
Proceedings of the IEEE Information Theory Workshop, 2021

2020
Second- and Third-Order Asymptotics of the Continuous-Time Poisson Channel.
IEEE Trans. Inf. Theory, 2020

Signaling to Relativistic Observers: An Einstein-Shannon-Riemann Encounter.
Probl. Inf. Transm., 2020

On the Maximum Entropy of a Sum of Independent Discrete Random Variables.
CoRR, 2020

2019
Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis.
IEEE Trans. Inf. Theory, 2019

Fundamental Limits of Communication Over State-Dependent Channels With Feedback.
IEEE Trans. Commun., 2019

Zero-Error Capacity of Duplication Channels.
IEEE Trans. Commun., 2019

Codes Correcting All Patterns of Tandem-Duplication Errors of Maximum Length 3.
CoRR, 2019

Second-Order Asymptotics of the Continuous-Time Poisson Channel.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Bounds on Codes for the Bit-Shift Channel with (d, k)-Constrained Inputs.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Some Enumeration Problems in the Duplication-Loss Model of Genome Rearrangement.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Codes in the Space of Multisets - Coding for Permutation Channels With Impairments.
IEEE Trans. Inf. Theory, 2018

Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems.
IEEE Commun. Lett., 2018

Runlength-Limited Sequences and Shift-Correcting Codes.
CoRR, 2018

Error-Free Communication Over State-Dependent Channels with Variable-Length Feedback.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Zero-Error Capacity of P-ary Shift Channels and FIFO Queues.
IEEE Trans. Inf. Theory, 2017

A Note on Parallel Asynchronous Channels With Arbitrary Skews.
IEEE Trans. Inf. Theory, 2017

Improved Bounds on Sidon Sets via Lattice Packings of Simplices.
SIAM J. Discret. Math., 2017

On Error Detection in Asymmetric Channels.
IEEE Commun. Lett., 2017

Coding for the permutation channel with insertions, deletions, substitutions, and erasures.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Sidon Sets of Fixed Cardinality and Lattice-Packings of Simplices.
CoRR, 2016

Zero-Error Shift-Correcting and Shift-Detecting Codes.
CoRR, 2016

2015
Information-geometric equivalence of transportation polytopes.
Probl. Inf. Transm., 2015

On the entropy of couplings.
Inf. Comput., 2015

Perfect codes in the discrete simplex.
Des. Codes Cryptogr., 2015

2014
Zero-Error Capacity of a Class of Timing Channels.
IEEE Trans. Inf. Theory, 2014

Difference Sets and Codes in $ A_n $ Lattices.
CoRR, 2014

2013
Some properties of Rényi entropy over countably infinite alphabets.
Probl. Inf. Transm., 2013

Subset Codes for Packet Networks.
IEEE Commun. Lett., 2013

Multiset Codes for Permutation Channels
CoRR, 2013

2012
On the hardness of entropy minimization and related problems.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

2011
On Rényi Entropies Over Countably Infinite Alphabets
CoRR, 2011


  Loading...