Seguir
Mladen Kovačević
Mladen Kovačević
University of Novi Sad, Serbia
Dirección de correo verificada de uns.ac.rs - Página principal
Título
Citado por
Citado por
Año
Codes in the space of multisets—Coding for permutation channels with impairments
M Kovačević, VYF Tan
IEEE Transactions on Information Theory 64 (7), 5156–5169, 2018
70*2018
Asymptotically optimal codes correcting fixed-length duplication errors in DNA storage systems
M Kovačević, VYF Tan
IEEE Communications Letters 22 (11), 2194–2197, 2018
592018
Zero-error capacity of a class of timing channels
M Kovačević, P Popovski
IEEE Transactions on Information Theory 60 (11), 6796–6800, 2014
392014
On the entropy of couplings
M Kovačević, I Stanojević, V Šenk
Information and Computation 242, 369–382, 2015
352015
Perfect codes in the discrete simplex
M Kovačević, D Vukobratović
Designs, Codes and Cryptography 75 (1), 81–95, 2015
252015
Zero-error capacity of duplication channels
M Kovačević
IEEE Transactions on Communications 67 (10), 6735–6742, 2019
202019
On the hardness of entropy minimization and related problems
M Kovačević, I Stanojević, V Šenk
IEEE Information Theory Workshop (ITW), Lausanne, Switzerland, 512-516, 2012
202012
Application of Maxeler dataflow supercomputing to spherical code design
I Stanojević, M Kovačević, V Šenk
Exploring the DataFlow Supercomputing Paradigm, 133–168, 2019
192019
Runlength-limited sequences and shift-correcting codes: Asymptotic analysis
M Kovačević
IEEE Transactions on Information Theory 65 (8), 4804–4814, 2019
18*2019
Subset codes for packet networks
M Kovačević, D Vukobratović
IEEE Communications Letters 17 (4), 729–732, 2013
16*2013
Improved bounds on Sidon sets via lattice packings of simplices
M Kovačević, VYF Tan
SIAM Journal on Discrete Mathematics 31 (3), 2269–2278, 2017
142017
Some properties of Rényi entropy over countably infinite alphabets
M Kovačević, I Stanojević, V Šenk
Problems of Information Transmission 49 (2), 99–110, 2013
132013
On the maximum number of non-confusable strings evolving under short tandem duplications
M Kovačević
Problems of Information Transmission 58 (2), 111–121, 2022
11*2022
Zero-error capacity of -ary shift channels and FIFO queues
M Kovačević, M Stojaković, VYF Tan
IEEE Transactions on Information Theory 63 (12), 7698–7707, 2017
112017
Multiset codes for permutation channels
M Kovačević, D Vukobratović
Preprint arXiv:1301.7564, 2013
102013
Codes correcting all patterns of tandem-duplication errors of maximum length 3
M Kovačević
Preprint arXiv:1911.06561, 2019
82019
Asymptotic behavior and typicality properties of runlength-limited sequences
M Kovačević, D Vukobratović
IEEE Transactions on Information Theory 68 (3), 1638–1650, 2022
6*2022
Signaling to relativistic observers: An Einstein–Shannon–Riemann encounter
M Kovačević
Problems of Information Transmission 56 (4), 303–308, 2020
52020
Second- and third-order asymptotics of the continuous-time Poisson channel
Y Sakai, VYF Tan, M Kovačević
IEEE Transactions on Information Theory 66 (8), 4742–4760, 2020
52020
A note on parallel asynchronous channels with arbitrary skews
M Kovačević
IEEE Transactions on Information Theory 63 (11), 7320–7321, 2017
52017
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20