default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMladen Kovacevic 0001
Person information
- unicode name: Mladen Kovačević
- unicode name: Младен Ковачевић
- affiliation: University of Novi Sad, Serbia
- affiliation (former): National University of Singapore, Electrical & Computer Engineering, Singapore
- affiliation (PhD 2014): University of Novi Sad, Serbia
Other persons with the same name
- Mladen Kovacevic 0002 — York University, Toronto, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j21]Mladen Kovacevic
:
Vector multispaces and multispace codes. Appl. Math. Comput. 486: 129041 (2025)- 2024
- [j20]Xiaolu Hou, Jakub Breier, Mladen Kovacevic:
Another Look at Side-Channel-Resistant Encoding Schemes. IEEE Trans. Very Large Scale Integr. Syst. 32(8): 1559-1563 (2024) - [i31]Keshav Goyal, Duc Tu Dao, Mladen Kovacevic, Han Mao Kiah:
Gilbert-Varshamov Bound for Codes in L1 Metric using Multivariate Analytic Combinatorics. CoRR abs/2402.14712 (2024) - [i30]Patrik Velcický, Jakub Breier, Mladen Kovacevic, Xiaolu Hou:
DeepNcode: Encoding-Based Protection against Bit-Flip Attacks on Neural Networks. CoRR abs/2405.13891 (2024) - 2023
- [c9]Keshav Goyal, Duc Tu Dao, Han Mao Kiah, Mladen Kovacevic:
Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics. ISIT 2023: 2458-2463 - [i29]Mladen Kovacevic, Iosif Pinelis, Marios Kountouris:
An Information-Theoretic Analog of the Twin Paradox. CoRR abs/2309.11862 (2023) - [i28]Mladen Kovacevic:
Vector Multispaces and Multispace Codes. CoRR abs/2312.14312 (2023) - [i27]Xiaolu Hou, Jakub Breier, Mladen Kovacevic:
Another Look at Side-Channel Resistant Encoding Schemes. IACR Cryptol. ePrint Arch. 2023: 1698 (2023) - 2022
- [j19]Mladen Kovacevic:
On the Maximum Number of Non-Confusable Strings Evolving under Short Tandem Duplications. Probl. Inf. Transm. 58(2): 111-121 (2022) - [j18]Mladen Kovacevic, Dejan Vukobratovic:
Asymptotic Behavior and Typicality Properties of Runlength-Limited Sequences. IEEE Trans. Inf. Theory 68(3): 1638-1650 (2022) - [c8]Mladen Kovacevic, Dejan Vukobratovic:
Optimal Error-Detecting Codes for General Asymmetric Channels via Sperner Theory. ITW 2022: 636-641 - [i26]Mladen Kovacevic, Dejan Vukobratovic:
Optimal Error-Detecting Codes for General Asymmetric Channels via Sperner Theory. CoRR abs/2205.07346 (2022) - 2021
- [c7]Mladen Kovacevic, Dejan Vukobratovic:
Asymptotics of Constant-Weight Constrained Sequences with Applications. ITW 2021: 1-6 - [i25]Mladen Kovacevic, Dejan Vukobratovic:
Asymptotic Behavior and Typicality Properties of Runlength-Limited Sequences. CoRR abs/2105.04617 (2021) - [i24]Mladen Kovacevic:
Lattice Packings of Cross-polytopes Constructed from Sidon Sets. CoRR abs/2111.03343 (2021) - 2020
- [j17]Mladen Kovacevic:
Signaling to Relativistic Observers: An Einstein-Shannon-Riemann Encounter. Probl. Inf. Transm. 56(4): 303-308 (2020) - [j16]Yuta Sakai, Vincent Y. F. Tan, Mladen Kovacevic:
Second- and Third-Order Asymptotics of the Continuous-Time Poisson Channel. IEEE Trans. Inf. Theory 66(8): 4742-4760 (2020) - [i23]Mladen Kovacevic:
Signaling to Relativistic Observers: An Einstein-Shannon-Riemann Encounter. CoRR abs/2005.03720 (2020) - [i22]Mladen Kovacevic:
On the Maximum Entropy of a Sum of Independent Discrete Random Variables. CoRR abs/2008.01138 (2020)
2010 – 2019
- 2019
- [j15]Mladen Kovacevic, Carol Wang, Vincent Y. F. Tan:
Fundamental Limits of Communication Over State-Dependent Channels With Feedback. IEEE Trans. Commun. 67(5): 3182-3191 (2019) - [j14]Mladen Kovacevic:
Zero-Error Capacity of Duplication Channels. IEEE Trans. Commun. 67(10): 6735-6742 (2019) - [j13]Mladen Kovacevic:
Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis. IEEE Trans. Inf. Theory 65(8): 4804-4814 (2019) - [c6]Mladen Kovacevic, Sanja Brdar, Vladimir S. Crnojevic:
Some Enumeration Problems in the Duplication-Loss Model of Genome Rearrangement. ISIT 2019: 927-931 - [c5]Mladen Kovacevic:
Bounds on Codes for the Bit-Shift Channel with (d, k)-Constrained Inputs. ISIT 2019: 1587-1591 - [c4]Yuta Sakai, Mladen Kovacevic, Vincent Y. F. Tan:
Second-Order Asymptotics of the Continuous-Time Poisson Channel. ITW 2019: 1-5 - [i21]Mladen Kovacevic, Sanja Brdar, Vladimir S. Crnojevic:
Some Enumeration Problems in the Duplication-Loss Model of Genome Rearrangement. CoRR abs/1902.00230 (2019) - [i20]Mladen Kovacevic:
Zero-Error Capacity of Duplication Channels. CoRR abs/1902.06275 (2019) - [i19]Yuta Sakai, Mladen Kovacevic, Vincent Y. F. Tan:
Second-Order Asymptotics of the Continuous-Time Poisson Channel. CoRR abs/1903.10438 (2019) - [i18]Mladen Kovacevic:
Codes Correcting All Patterns of Tandem-Duplication Errors of Maximum Length 3. CoRR abs/1911.06561 (2019) - 2018
- [j12]Mladen Kovacevic, Vincent Y. F. Tan:
Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems. IEEE Commun. Lett. 22(11): 2194-2197 (2018) - [j11]Mladen Kovacevic, Vincent Y. F. Tan:
Codes in the Space of Multisets - Coding for Permutation Channels With Impairments. IEEE Trans. Inf. Theory 64(7): 5156-5169 (2018) - [c3]Carol Wang, Mladen Kovacevic, Vincent Y. F. Tan:
Error-Free Communication Over State-Dependent Channels with Variable-Length Feedback. ISIT 2018: 286-290 - [i17]Mladen Kovacevic:
Runlength-Limited Sequences and Shift-Correcting Codes. CoRR abs/1803.06117 (2018) - [i16]Mladen Kovacevic, Vincent Y. F. Tan:
Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems. CoRR abs/1808.10328 (2018) - 2017
- [j10]Mladen Kovacevic:
On Error Detection in Asymmetric Channels. IEEE Commun. Lett. 21(9): 1933-1936 (2017) - [j9]Mladen Kovacevic, Vincent Y. F. Tan:
Improved Bounds on Sidon Sets via Lattice Packings of Simplices. SIAM J. Discret. Math. 31(3): 2269-2278 (2017) - [j8]Mladen Kovacevic:
A Note on Parallel Asynchronous Channels With Arbitrary Skews. IEEE Trans. Inf. Theory 63(11): 7320-7321 (2017) - [j7]Mladen Kovacevic, Milos Stojakovic, Vincent Y. F. Tan:
Zero-Error Capacity of P-ary Shift Channels and FIFO Queues. IEEE Trans. Inf. Theory 63(12): 7698-7707 (2017) - [c2]Mladen Kovacevic, Vincent Y. F. Tan:
Coding for the permutation channel with insertions, deletions, substitutions, and erasures. ISIT 2017: 1933-1937 - [i15]Mladen Kovacevic:
On Error Detection in Asymmetric Channels. CoRR abs/1706.04540 (2017) - [i14]Mladen Kovacevic:
A Note on Parallel Asynchronous Channels with Arbitrary Skews. CoRR abs/1710.09575 (2017) - [i13]Mladen Kovacevic, Carol Wang, Vincent Y. F. Tan:
Error-Free Communication Over State-Dependent Channels with Variable-Length Feedback. CoRR abs/1712.07756 (2017) - 2016
- [i12]Mladen Kovacevic, Milos Stojakovic, Vincent Y. F. Tan:
Zero-Error Shift-Correcting and Shift-Detecting Codes. CoRR abs/1605.02441 (2016) - [i11]Mladen Kovacevic, Vincent Y. F. Tan:
Sidon Sets of Fixed Cardinality and Lattice-Packings of Simplices. CoRR abs/1610.01341 (2016) - [i10]Mladen Kovacevic, Vincent Y. F. Tan:
Coding for the Permutation Channel with Insertions, Deletions, Substitutions, and Erasures. CoRR abs/1612.08837 (2016) - 2015
- [j6]Mladen Kovacevic, Dejan Vukobratovic:
Perfect codes in the discrete simplex. Des. Codes Cryptogr. 75(1): 81-95 (2015) - [j5]Mladen Kovacevic, Ivan Stanojevic, Vojin Senk:
On the entropy of couplings. Inf. Comput. 242: 369-382 (2015) - [j4]Mladen Kovacevic, Ivan Stanojevic, Vojin Senk:
Information-geometric equivalence of transportation polytopes. Probl. Inf. Transm. 51(2): 103-109 (2015) - 2014
- [j3]Mladen Kovacevic, Petar Popovski:
Zero-Error Capacity of a Class of Timing Channels. IEEE Trans. Inf. Theory 60(11): 6796-6800 (2014) - [i9]Mladen Kovacevic, Ivan Stanojevic, Vojin Senk:
Information-Geometric Equivalence of Transportation Polytopes. CoRR abs/1402.3175 (2014) - [i8]Mladen Kovacevic:
Difference Sets and Codes in $ A_n $ Lattices. CoRR abs/1409.5276 (2014) - 2013
- [j2]Mladen Kovacevic, Dejan Vukobratovic:
Subset Codes for Packet Networks. IEEE Commun. Lett. 17(4): 729-732 (2013) - [j1]Mladen Kovacevic, Ivan Stanojevic, Vojin Senk:
Some properties of Rényi entropy over countably infinite alphabets. Probl. Inf. Transm. 49(2): 99-110 (2013) - [i7]Mladen Kovacevic, Dejan Vukobratovic:
Multiset Codes for Permutation Channels. CoRR abs/1301.7564 (2013) - [i6]Mladen Kovacevic, Ivan Stanojevic, Vojin Senk:
On the Entropy of Couplings. CoRR abs/1303.3235 (2013) - [i5]Mladen Kovacevic, Dejan Vukobratovic:
Perfect Codes in the Discrete Simplex. CoRR abs/1307.3142 (2013) - [i4]Mladen Kovacevic, Petar Popovski:
Zero-Error Capacity of a Class of Timing Channels. CoRR abs/1311.1339 (2013) - 2012
- [c1]Mladen Kovacevic, Ivan Stanojevic, Vojin Senk:
On the hardness of entropy minimization and related problems. ITW 2012: 512-516 - [i3]Mladen Kovacevic, Ivan Stanojevic, Vojin Senk:
On the Hardness of Entropy Minimization and Related Problems. CoRR abs/1207.1238 (2012) - [i2]Mladen Kovacevic, Dejan Vukobratovic:
Subset Codes for Packet Networks. CoRR abs/1210.7341 (2012) - 2011
- [i1]Mladen Kovacevic, Ivan Stanojevic, Vojin Senk:
On Rényi Entropies Over Countably Infinite Alphabets. CoRR abs/1106.5130 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
