Mladen Kovacevic

IACR Cryptol. ePrint Arch., 2023

Vector Multispaces and Multispace Codes.

[BibT_eX]

[DOI]

CoRR, 2023

An Information-Theoretic Analog of the Twin Paradox.

[BibT_eX]

[DOI]

Iosif Pinelis

Marios Kountouris

CoRR, 2023

Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Asymptotic Behavior and Typicality Properties of Runlength-Limited Sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

On the Maximum Number of Non-Confusable Strings Evolving under Short Tandem Duplications.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2022

Optimal Error-Detecting Codes for General Asymmetric Channels via Sperner Theory.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2022

2021

Lattice Packings of Cross-polytopes Constructed from Sidon Sets.

[BibT_eX]

[DOI]

CoRR, 2021

Asymptotics of Constant-Weight Constrained Sequences with Applications.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2021

2020

Second- and Third-Order Asymptotics of the Continuous-Time Poisson Channel.

[BibT_eX]

[DOI]

Yuta Sakai

IEEE Trans. Inf. Theory, 2020

Signaling to Relativistic Observers: An Einstein-Shannon-Riemann Encounter.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

2019

Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Fundamental Limits of Communication Over State-Dependent Channels With Feedback.

[BibT_eX]

[DOI]

Carol Wang

IEEE Trans. Commun., 2019

Zero-Error Capacity of Duplication Channels.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

Second-Order Asymptotics of the Continuous-Time Poisson Channel.

[BibT_eX]

[DOI]

Yuta Sakai

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Bounds on Codes for the Bit-Shift Channel with (d, k)-Constrained Inputs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Some Enumeration Problems in the Duplication-Loss Model of Genome Rearrangement.

[BibT_eX]

[DOI]

Sanja Brdar

Vladimir S. Crnojevic

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Codes in the Space of Multisets - Coding for Permutation Channels With Impairments.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2018

Runlength-Limited Sequences and Shift-Correcting Codes.

[BibT_eX]

[DOI]

CoRR, 2018

Error-Free Communication Over State-Dependent Channels with Variable-Length Feedback.

[BibT_eX]

[DOI]

Carol Wang

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Zero-Error Capacity of P-ary Shift Channels and FIFO Queues.

[BibT_eX]

[DOI]

Milos Stojakovic

IEEE Trans. Inf. Theory, 2017

A Note on Parallel Asynchronous Channels With Arbitrary Skews.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Improved Bounds on Sidon Sets via Lattice Packings of Simplices.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

On Error Detection in Asymmetric Channels.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2017

Coding for the permutation channel with insertions, deletions, substitutions, and erasures.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Sidon Sets of Fixed Cardinality and Lattice-Packings of Simplices.

[BibT_eX]

[DOI]

CoRR, 2016

Zero-Error Shift-Correcting and Shift-Detecting Codes.

[BibT_eX]

[DOI]

Milos Stojakovic

CoRR, 2016

2015

Information-geometric equivalence of transportation polytopes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2015

On the entropy of couplings.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Perfect codes in the discrete simplex.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

2014

Zero-Error Capacity of a Class of Timing Channels.

[BibT_eX]

[DOI]

Petar Popovski

IEEE Trans. Inf. Theory, 2014

Difference Sets and Codes in $ A_n $ Lattices.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Some properties of Rényi entropy over countably infinite alphabets.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2013

Subset Codes for Packet Networks.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2013

Multiset Codes for Permutation Channels

[BibT_eX]

[DOI]

CoRR, 2013

2012

On the hardness of entropy minimization and related problems.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

2011

On Rényi Entropies Over Countably Infinite Alphabets

[BibT_eX]

[DOI]