Ran Tamir

Orcid: 0000-0002-8291-6092

Affiliations:
  • ETH Zurich, Switzerland
  • Technion, Andrew and Erna Viterbi Faculty of Electrical Engineering, Haifa, Israel (PhD 2021)


According to our database1, Ran Tamir authored at least 26 papers between 2017 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Concatenated Codes for Short-Molecule DNA Storage with Sequencing Channels of Positive Zero-Undetected-Error Capacity.
CoRR, February, 2026

2025
DNA Storage in the Short Molecule Regime.
CoRR, November, 2025

Optimising Computational Measures from Behavioural Data Predicts Perceived Consonance.
Trans. Int. Soc. Music. Inf. Retr., 2025

Achievable Rates and Error Probability Bounds of Frequency-Based Channels of Unlimited Input Resolution.
IEEE J. Sel. Areas Inf. Theory, 2025

Entropy Estimation from Queries and Auxiliary Distribution Samples.
Proceedings of the IEEE International Symposium on Information Theory, 2025

Achievable Rates of Frequency-based Channels of Unlimited Input Resolution.
Proceedings of the IEEE International Symposium on Information Theory, 2025


2023
Error Exponents of the Dirty-Paper and Gel'fand-Pinsker Channels.
Proceedings of the IEEE Information Theory Workshop, 2023

Entropy Rate Bounds of Integer-Valued Processes via Second-Order Statistics.
Proceedings of the IEEE Information Theory Workshop, 2023

Reaching Consensus in Dense Erdős-Rényi Graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2023

On Correlation Detection of Gaussian Databases via Local Decision Making.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Simple Majority Consensus in Networks with Unreliable Communication.
Entropy, 2022

Joint Correlation Detection and Alignment of Gaussian Databases.
CoRR, 2022

Fast Convergence to Unanimity in Dense Erdős-Rényi Graphs.
CoRR, 2022

Entropy Rate Bounds via Second-Order Statistics.
CoRR, 2022

Universal Decoding for the Typical Random Code and for the Expurgated Code.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Error Exponents in the Bee Identification Problem.
IEEE Trans. Inf. Theory, 2021

Trade-offs between Error Exponents and Excess-Rate Exponents of Typical Slepian-Wolf Codes.
Entropy, 2021

Brief Announcement: Simple Majority Consensus in Networks with Unreliable Communication.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

2020
Large Deviations Behavior of the Logarithmic Error Probability of Random Codes.
IEEE Trans. Inf. Theory, 2020

The MMI Decoder is Asymptotically Optimal for the Typical Random Code and for the Expurgated Code.
CoRR, 2020

2019
Expurgated Bounds for the Asymmetric Broadcast Channel.
IEEE Trans. Inf. Theory, 2019

Error Exponents of Typical Random Codes of Source-Channel Coding.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Large Deviations of Typical Random Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Exact Random Coding Exponents and Universal Decoders for the Asymmetric Broadcast Channel.
IEEE Trans. Inf. Theory, 2018

2017
Exact random coding exponents and universal decoders for the degraded broadcast channel.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017


  Loading...