default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeri Merhav
Person information
- affiliation: Technion - Israel Institute of Technology, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j212]Neri Merhav:
Lossy Compression of Individual Sequences Revisited: Fundamental Limits of Finite-State Encoders. Entropy 26(2): 116 (2024)- [j211]Neri Merhav:
Refinements and Extensions of Ziv's Model of Perfect Secrecy for Individual Sequences. Entropy 26(6): 503 (2024) - [j210]Sergey Loyka
, Neri Merhav:
The Secrecy Capacity of the Wiretap Channel With Additive Noise and Rate-Limited Help. IEEE Trans. Inf. Theory 70(1): 189-205 (2024) - [j209]Neri Merhav:
Parameter Estimation Based on Noisy Chaotic Signals in the Weak-Noise Regime. IEEE Trans. Inf. Theory 70(8): 6107-6117 (2024) - [j208]Anatoly Khina, Neri Merhav:
Modulation and Estimation With a Helper. IEEE Trans. Inf. Theory 70(9): 6189-6210 (2024) - [c119]Anatoly Khina, Neri Merhav:
Power-limited Modulation-Estimation with a Helper. ISIT 2024: 635-640 - [c118]Neri Merhav:
Parameter Estimation Based on Noisy Chaotic Signals in the Weak-Noise Regime. ISIT 2024: 3612-3617 - [i129]Neri Merhav:
Lossy Compression of Individual Sequences Revisited: Fundamental Limits of Finite-State Encoders. CoRR abs/2401.01779 (2024) - [i128]Neri Merhav:
Universal Slepian-Wolf coding for individual sequences. CoRR abs/2403.07409 (2024) - [i127]Yossi Marciano, Neri Merhav:
Optimal Signals and Detectors Based on Correlation and Energy. CoRR abs/2405.02931 (2024) - [i126]Neri Merhav:
Refinements and Extensions of Ziv's Model of Perfect Secrecy for Individual Sequences. CoRR abs/2405.05752 (2024) - [i125]Neri Merhav, Nir Weinberger:
A Toolbox for Refined Information-Theoretic Analyses with Applications. CoRR abs/2406.00744 (2024) - [i124]Neri Merhav:
On Jacob Ziv's Individual-Sequence Approach to Information Theory. CoRR abs/2406.02904 (2024) - [i123]Neri Merhav:
Two New Families of Local Asymptotically Minimax Lower Bounds in Parameter Estimation. CoRR abs/2409.12491 (2024) - 2023
- [j207]Neri Merhav:
Some Families of Jensen-like Inequalities with Application to Information Theory. Entropy 25(5): 752 (2023) - [j206]Neri Merhav:
A Universal Random Coding Ensemble for Sample-Wise Lossy Compression. Entropy 25(8): 1199 (2023) - [j205]Neri Merhav, Georg Böcherer:
Codebook Mismatch can be Fully Compensated by Mismatched Decoding. IEEE Trans. Inf. Theory 69(4): 2152-2164 (2023) - [j204]Neri Merhav:
D-Semifaithful Codes That are Universal Over Both Memoryless Sources and Distortion Measures. IEEE Trans. Inf. Theory 69(7): 4746-4757 (2023) - [j203]Ran Tamir, Neri Merhav:
Error Exponents of the Dirty-Paper and Gel'fand-Pinsker Channels. IEEE Trans. Inf. Theory 69(12): 7479-7498 (2023) - [c117]Sergey Loyka, Neri Merhav:
The Secrecy Capacity of Gaussian Wiretap Channels with Rate-Limited Help at the Encoder. ITW 2023: 198-202 - [c116]Ran Tamir, Neri Merhav:
Error Exponents of the Dirty-Paper and Gel'fand-Pinsker Channels. ITW 2023: 272-276 - [i122]Neri Merhav:
Some families of Jensen-like inequalities with application to information theory. CoRR abs/2304.03063 (2023) - [i121]Neri Merhav:
Trade-offs Between Weak-Noise Performance and Probability of Anomaly in Parameter Estimation from Noisy Chaotic Signals. CoRR abs/2308.00506 (2023) - [i120]Anatoly Khina, Neri Merhav:
Modulation and Estimation with a Helper. CoRR abs/2309.04277 (2023) - 2022
- [j202]Neri Merhav:
Reversing Jensen's Inequality for Information-Theoretic Analyses. Inf. 13(1): 39 (2022) - [j201]Neri Merhav:
On More General Distributions of Random Binning for Slepian-Wolf Encoding. IEEE Trans. Inf. Theory 68(2): 737-751 (2022) - [j200]Neri Merhav:
Finite-State Source-Channel Coding for Individual Source Sequences With Source Side Information at the Decoder. IEEE Trans. Inf. Theory 68(3): 1532-1544 (2022) - [j199]Ran Tamir, Neri Merhav:
Universal Decoding for the Typical Random Code and for the Expurgated Code. IEEE Trans. Inf. Theory 68(4): 2156-2168 (2022) - [j198]Robert Graczyk, Amos Lapidoth, Neri Merhav, Christoph Pfister:
Guessing Based on Compressed Side Information. IEEE Trans. Inf. Theory 68(7): 4244-4256 (2022) - [j197]Nir Weinberger, Neri Merhav:
The DNA Storage Channel: Capacity and Error Probability Bounds. IEEE Trans. Inf. Theory 68(9): 5657-5700 (2022) - [j196]Asaf Cohen, Neri Merhav:
Universal Randomized Guessing Subject to Distortion. IEEE Trans. Inf. Theory 68(12): 7714-7734 (2022) - [j195]Neri Merhav:
Optimal Correlators and Waveforms for Mismatched Detection. IEEE Trans. Inf. Theory 68(12): 8342-8354 (2022) - [c115]Ran Tamir, Neri Merhav:
Universal Decoding for the Typical Random Code and for the Expurgated Code. ISIT 2022: 19-24 - [c114]Neri Merhav:
Reversing Jensen's Inequality for Information-Theoretic Analyses. ISIT 2022: 940-945 - [c113]Sergey Loyka, Neri Merhav:
The Secrecy Capacity of The Gaussian Wiretap Channel with Rate-Limited Help at the Decoder. ISIT 2022: 1040-1045 - [c112]Neri Merhav:
Encoding Individual Sequences for the Wiretap Channel. ISIT 2022: 1046-1051 - [c111]Nir Weinberger, Neri Merhav:
The DNA Storage Channel: Capacity and Error Probability Bounds. ISIT 2022: 1803-1808 - [c110]Asaf Cohen, Neri Merhav:
Universal Randomized Guessing Subject to Distortion. ISIT 2022: 3345-3350 - [i119]Neri Merhav:
Optimal Correlators and Waveforms for Mismatched Detection. CoRR abs/2202.02760 (2022) - [i118]Neri Merhav:
D-semifaithful codes that are universal over both memoryless sources and distortion measures. CoRR abs/2203.03305 (2022) - [i117]Ran Tamir, Neri Merhav:
Error Exponents of the Dirty-Paper and Gel'fand-Pinsker Channels. CoRR abs/2205.07140 (2022) - [i116]Neri Merhav, Georg Bocherer:
Codebook Mismatch Can Be Fully Compensated by Mismatched Decoding. CoRR abs/2206.10123 (2022) - [i115]Sergey Loyka, Neri Merhav:
The Secrecy Capacity of The Gaussian Wiretap Channel with Rate-Limited Help. CoRR abs/2209.09356 (2022) - [i114]Neri Merhav:
A Universal Random Coding Ensemble for Sample-wise Lossy Compression. CoRR abs/2212.12208 (2022) - 2021
- [j194]Ran Tamir, Neri Merhav:
Trade-offs between Error Exponents and Excess-Rate Exponents of Typical Slepian-Wolf Codes. Entropy 23(3): 265 (2021) - [j193]Neri Merhav:
Encoding Individual Source Sequences for the Wiretap Channel. Entropy 23(12): 1694 (2021) - [j192]Neri Merhav:
Universal Decoding for Asynchronous Slepian-Wolf Encoding. IEEE Trans. Inf. Theory 67(5): 2652-2662 (2021) - [j191]Neri Merhav:
Optimal Correlators for Detection and Estimation in Optical Receivers. IEEE Trans. Inf. Theory 67(8): 5200-5210 (2021) - [j190]Ran Tamir, Neri Merhav:
Error Exponents in the Bee Identification Problem. IEEE Trans. Inf. Theory 67(10): 6564-6582 (2021) - [j189]Neri Merhav:
On Error Exponents of Encoder-Assisted Communication Systems. IEEE Trans. Inf. Theory 67(11): 7019-7029 (2021) - [c109]Neri Merhav:
On Error Exponents of Encoder-Assisted Communication Systems. ISIT 2021: 918-923 - [c108]Ran Tamir Averbuch, Neri Merhav:
Trade-Offs Between Error and Excess-Rate Exponents of Typical Slepian-Wolf Codes. ISIT 2021: 924-929 - [c107]Neri Merhav:
On More General Distributions of Random Binning for Slepian-Wolf Encoding. ISIT 2021: 2298-2303 - [c106]Neri Merhav:
Optimal Correlators for Detection and Estimation in Optical Receivers. ISIT 2021: 3097-3102 - [i113]Robert Graczyk, Amos Lapidoth, Neri Merhav, Christoph Pfister:
Guessing Based on Compressed Side Information. CoRR abs/2106.13341 (2021) - [i112]Neri Merhav:
Conveying individual source sequences over memoryless channels using finite-state decoders with source side information. CoRR abs/2107.08778 (2021) - [i111]Nir Weinberger, Neri Merhav:
The DNA Storage Channel: Capacity and Error Probability. CoRR abs/2109.12549 (2021) - [i110]Neri Merhav:
Encoding Individual Source Sequences for the Wiretap Channel. CoRR abs/2112.08099 (2021) - [i109]Asaf Cohen, Neri Merhav:
Universal Randomized Guessing Subjected to Distortion. CoRR abs/2112.13594 (2021) - 2020
- [j188]Neri Merhav, Igal Sason:
An Integral Representation of the Logarithmic Function with Applications in Information Theory. Entropy 22(1): 51 (2020) - [j187]Neri Merhav, Igal Sason:
Some Useful Integral Representations for Information-Theoretic Analyses. Entropy 22(6): 707 (2020) - [j186]Neri Merhav, Asaf Cohen:
Universal Randomized Guessing With Application to Asynchronous Decentralized Brute-Force Attacks. IEEE Trans. Inf. Theory 66(1): 114-129 (2020) - [j185]Neri Merhav:
Error Exponents of Typical Random Trellis Codes. IEEE Trans. Inf. Theory 66(4): 2067-2077 (2020) - [j184]Neri Merhav:
Guessing Individual Sequences: Generating Randomized Guesses Using Finite-State Machines. IEEE Trans. Inf. Theory 66(5): 2912-2920 (2020) - [j183]Neri Merhav:
Weak-Noise Modulation-Estimation of Vector Parameters. IEEE Trans. Inf. Theory 66(5): 3268-3276 (2020) - [j182]Neri Merhav:
A Lagrange-Dual Lower Bound to the Error Exponent of the Typical Random Code. IEEE Trans. Inf. Theory 66(6): 3456-3464 (2020) - [j181]Neri Merhav:
Noisy Guesses. IEEE Trans. Inf. Theory 66(8): 4796-4803 (2020) - [j180]Ran Tamir, Neri Merhav, Nir Weinberger, Albert Guillén i Fàbregas:
Large Deviations Behavior of the Logarithmic Error Probability of Random Codes. IEEE Trans. Inf. Theory 66(11): 6635-6659 (2020) - [c105]Neri Merhav:
Weak-Noise Modulation-Estimation of Vector Parameters. ISIT 2020: 1219-1223 - [c104]Neri Merhav:
Noisy Guesses. ISIT 2020: 2184-2188 - [c103]Neri Merhav, Igal Sason:
Exact Expressions in Source and Channel Coding Problems Using Integral Representations. ISIT 2020: 2343-2348 - [c102]Neri Merhav:
Universal Decoding for Asynchronous Slepian-Wolf Encoding. ITW 2020: 1-5 - [i108]Neri Merhav:
Optimal Correlators for Detection and Estimation in Optical Receivers. CoRR abs/2004.02458 (2020) - [i107]Neri Merhav, Igal Sason:
Some Useful Integral Representations for Information-Theoretic Analyses. CoRR abs/2005.05795 (2020) - [i106]Ran Tamir, Neri Merhav:
Trade-offs Between Error Exponents and Excess-Rate Exponents of Typical Slepian-Wolf Codes. CoRR abs/2005.08205 (2020) - [i105]Léo Touzo, Matteo Marsili, Neri Merhav, Édgar Roldán:
Optimal Work Extraction and the Minimum Description Length Principle. CoRR abs/2006.04544 (2020) - [i104]Ran Tamir, Neri Merhav:
The MMI Decoder is Asymptotically Optimal for the Typical Random Code and for the Expurgated Code. CoRR abs/2007.12225 (2020) - [i103]Neri Merhav:
Universal Decoding for Asynchronous Slepian-Wolf Encoding. CoRR abs/2007.12863 (2020) - [i102]Neri Merhav:
On More General Distributions of Random Binning for Slepian-Wolf Encoding. CoRR abs/2009.08839 (2020) - [i101]Ran Tamir, Neri Merhav:
Error Exponents in the Bee Identification Problem. CoRR abs/2011.09799 (2020) - [i100]Neri Merhav:
On Error Exponents of Encoder-Assisted Communication Systems. CoRR abs/2011.10276 (2020)
2010 – 2019
- 2019
- [j179]Benedetta Tondi, Neri Merhav, Mauro Barni:
Detection Games under Fully Active Adversaries. Entropy 21(1): 23 (2019) - [j178]Neri Merhav:
Ensemble Performance of Biometric Authentication Systems Based on Secret Key Generation. IEEE Trans. Inf. Theory 65(4): 2477-2491 (2019) - [j177]Ran Averbuch, Nir Weinberger, Neri Merhav:
Expurgated Bounds for the Asymmetric Broadcast Channel. IEEE Trans. Inf. Theory 65(6): 3412-3435 (2019) - [j176]Wasim Huleihel, Salman Salamatian, Neri Merhav, Muriel Médard:
Gaussian Intersymbol Interference Channels With Mismatch. IEEE Trans. Inf. Theory 65(7): 4499-4517 (2019) - [j175]Neri Merhav:
False-Accept/False-Reject Trade-Offs for Ensembles of Biometric Authentication Systems. IEEE Trans. Inf. Theory 65(8): 4997-5006 (2019) - [j174]Neri Merhav:
Tradeoffs Between Weak-Noise Estimation Performance and Outage Exponents in Nonlinear Modulation. IEEE Trans. Inf. Theory 65(8): 5189-5196 (2019) - [j173]Neri Merhav:
Error Exponents of Typical Random Codes for the Colored Gaussian Channel. IEEE Trans. Inf. Theory 65(12): 8164-8179 (2019) - [c101]Neri Merhav, Asaf Cohen:
Universal Randomized Guessing with Application to Asynchronous Decentralized Brute - Force Attacks. ISIT 2019: 485-489 - [c100]Neri Merhav:
False-Accept/False-Reject Trade-offs for Ensembles of Biometric Authentication Systems. ISIT 2019: 802-806 - [c99]Neri Merhav:
Trading off Weak-Noise Estimation Performance and Outage Exponents in Nonlinear Modulation. ISIT 2019: 882-886 - [c98]Neri Merhav:
Error Exponents of Typical Random Codes for the Colored Gaussian Channel. ISIT 2019: 2669-2673 - [c97]Ran Averbuch, Neri Merhav, Albert Guillén i Fàbregas:
Large Deviations of Typical Random Codes. ISIT 2019: 2933-2937 - [c96]Ran Averbuch, Neri Merhav:
Error Exponents of Typical Random Codes of Source-Channel Coding. ITW 2019: 1-5 - [c95]Neri Merhav:
Error Exponents of Typical Random Trellis Codes. ITW 2019: 1-5 - [i99]Neri Merhav:
Error Exponents of Typical Random Trellis Codes. CoRR abs/1903.01120 (2019) - [i98]Neri Merhav:
Weak-Noise Modulation-Estimation of Vector Parameters. CoRR abs/1904.11178 (2019) - [i97]Neri Merhav:
Guessing Individual Sequences: Generating Randomized Guesses Using Finite-State Machines. CoRR abs/1906.10857 (2019) - [i96]Neri Merhav:
A Lagrange-Dual Lower Bound to the Error Exponent Function of the Typical Random Code. CoRR abs/1908.04024 (2019) - [i95]Neri Merhav:
Noisy Guesses. CoRR abs/1910.00215 (2019) - [i94]Neri Merhav, Igal Sason:
An Integral Representation of the Logarithmic Function with Applications in Information Theory. CoRR abs/1912.05812 (2019) - [i93]Ran Tamir, Neri Merhav, Nir Weinberger, Albert Guillen i Fabregas:
Large Deviations Behavior of the Logarithmic Error Probability of Random Codes. CoRR abs/1912.09657 (2019) - 2018
- [j172]Ayse Ünsal, Raymond Knopp, Neri Merhav:
Converse Bounds on Modulation-Estimation Performance for the Gaussian Multiple-Access Channel. IEEE Trans. Inf. Theory 64(2): 1217-1230 (2018) - [j171]Neri Merhav:
Universal Decoding Using a Noisy Codebook. IEEE Trans. Inf. Theory 64(4): 2231-2239 (2018) - [j170]Ran Averbuch, Neri Merhav:
Exact Random Coding Exponents and Universal Decoders for the Asymmetric Broadcast Channel. IEEE Trans. Inf. Theory 64(7): 5070-5086 (2018) - [j169]Neri Merhav:
Error Exponents of Typical Random Codes. IEEE Trans. Inf. Theory 64(9): 6223-6235 (2018) - [j168]Neri Merhav:
Lower Bounds on Exponential Moments of the Quadratic Error in Parameter Estimation. IEEE Trans. Inf. Theory 64(12): 7636-7648 (2018) - [c94]Neri Merhav:
Lower Bounds on Exponential Moments of the Quadratic Error in Parameter Estimation. ISIT 2018: 741-745 - [c93]Neri Merhav:
Ensemble Performance of Biometric Authentication Systems Based on Secret Key Generation. ISIT 2018: 1455-1459 - [c92]Neri Merhav:
Error Exponents of Typical Random Codes. ISIT 2018: 1675-1679 - [i92]Benedetta Tondi, Neri Merhav, Mauro Barni:
Detection Games Under Fully Active Adversaries. CoRR abs/1802.02850 (2018) - [i91]Neri Merhav:
Trade-offs Between Weak-Noise Estimation Performance and Outage Exponents in Nonlinear Modulation. CoRR abs/1802.04627 (2018) - [i90]Neri Merhav:
False-Accept/False-Reject Trade-offs in Biometric Authentication Systems. CoRR abs/1805.12333 (2018) - [i89]Neri Merhav, Asaf Cohen:
Universal Randomized Guessing with Application to Asynchronous Decentralized Brute-Force Attacks. CoRR abs/1811.04363 (2018) - [i88]Neri Merhav:
Error Exponents of Typical Random Codes for the Colored Gaussian Channel. CoRR abs/1812.06250 (2018) - 2017
- [j167]Wasim Huleihel, Neri Merhav:
Asymptotic MMSE analysis under sparse representation modeling. Signal Process. 131: 320-332 (2017) - [j166]Mani Bastani Parizi, Emre Telatar, Neri Merhav:
Exact Random Coding Secrecy Exponents for the Wiretap Channel. IEEE Trans. Inf. Theory 63(1): 509-531 (2017) - [j165]Wasim Huleihel, Neri Merhav:
Random Coding Error Exponents for the Two-User Interference Channel. IEEE Trans. Inf. Theory 63(2): 1019-1042 (2017) - [j164]Nir Weinberger, Neri Merhav:
A Large Deviations Approach to Secure Lossy Compression. IEEE Trans. Inf. Theory 63(4): 2533-2559 (2017) - [j163]Neri Merhav:
Reliability of Universal Decoding Based on Vector-Quantized Codewords. IEEE Trans. Inf. Theory 63(5): 2696-2709 (2017) - [j162]Nir Weinberger, Neri Merhav:
Lower Bounds on Parameter Modulation-Estimation Under Bandwidth Constraints. IEEE Trans. Inf. Theory 63(6): 3854-3874 (2017) - [j161]Nir Weinberger, Neri Merhav:
Simplified Erasure/List Decoding. IEEE Trans. Inf. Theory 63(7): 4218-4239 (2017) - [j160]Neri Merhav:
The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds. IEEE Trans. Inf. Theory 63(8): 5039-5051 (2017) - [j159]