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
- 2025
[j215]Neri Merhav, Nir Weinberger:
A Toolbox for Refined Information-Theoretic Analyses. Found. Trends Commun. Inf. Theory 22(1): 1-184 (2025)- [j214]Neri Merhav
:
Universal Slepian-Wolf Coding for Individual Sequences. IEEE Trans. Inf. Theory 71(1): 783-796 (2025) - [j213]Yossi Marciano, Neri Merhav:
Optimal Signals and Detectors Based on Correlation and Energy. IEEE Trans. Inf. Theory 71(1): 833-846 (2025) - 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]Nir Weinberger, Neri Merhav:
Channel Detection in Coded Communication. IEEE Trans. Inf. Theory 63(10): 6364-6392 (2017) - [j158]Neri Merhav:
Correction to "The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds". IEEE Trans. Inf. Theory 63(10): 6827-6829 (2017) - [j157]Neri Merhav:
On Empirical Cumulant Generating Functions of Code Lengths for Individual Sequences. IEEE Trans. Inf. Theory 63(12): 7729-7736 (2017) - [c91]Ran Averbuch, Neri Merhav:
Exact random coding exponents and universal decoders for the degraded broadcast channel. ISIT 2017: 191-195 - [c90]Neri Merhav:
Reliability of universal decoding based on vector-quantized codewords. ISIT 2017: 1311-1315 - [c89]Neri Merhav:
On empirical cumulant generating functions of code lengths for individual sequences. ISIT 2017: 1500-1504 - [c88]Nir Weinberger, Neri Merhav:
Lower bounds on parameter modulation-estimation under bandwidth constraints. ISIT 2017: 2093-2097 - [c87]Wasim Huleihel, Salman Salamatian, Neri Merhav, Muriel Médard:
Gaussian ISI channels with mismatch. ISIT 2017: 2815-2819 - [c86]Neri Merhav:
Universal decoding using a noisy codebook. ISIT 2017: 2845-2849 - [c85]Shai Ginzach, Neri Merhav, Igal Sason:
Random-coding error exponent of variable-length codes with a single-bit noiseless feedback. ITW 2017: 584-588 - [i87]Ran Averbuch, Neri Merhav:
Exact Random Coding Exponents and Universal Decoders for the Asymmetric Broadcast Channel. CoRR abs/1702.08003 (2017) - [i86]Neri Merhav:
Lower Bounds on Exponential Moments of the Quadratic Error in Parameter Estimation. CoRR abs/1703.00188 (2017) - [i85]Wasim Huleihel, Salman Salamatian, Neri Merhav, Muriel Médard:
Gaussian Intersymbol Interference Channels With Mismatch. CoRR abs/1706.05883 (2017) - [i84]Neri Merhav:
Correction to "The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds". CoRR abs/1707.03987 (2017) - [i83]Neri Merhav:
Ensemble Performance of Biometric Authentication Systems Based on Secret Key Generation. CoRR abs/1707.09108 (2017) - [i82]Neri Merhav:
Error exponents of typical random codes. CoRR abs/1708.07301 (2017) - [i81]Ran Averbuch, Nir Weinberger, Neri Merhav:
Expurgated Bounds for the Asymmetric Broadcast Channel. CoRR abs/1711.10299 (2017) - 2016
- [j156]Neri Merhav:
Universal decoding for source-channel coding with side information. Commun. Inf. Syst. 16(1): 17-58 (2016) - [j155]Wasim Huleihel, Nir Weinberger, Neri Merhav:
Erasure/List Random Coding Error Exponents Are Not Universally Achievable. IEEE Trans. Inf. Theory 62(10): 5403-5421 (2016) - [c84]Ayse Ünsal, Raymond Knopp, Neri Merhav:
Lower bounds on joint modulation-estimation performance for the Gaussian MAC. ISIT 2016: 590-594 - [c83]Nir Weinberger, Neri Merhav:
A large deviations approach to secure lossy compression. ISIT 2016: 765-769 - [c82]Neri Merhav:
Universal decoding for source-channel coding with side information. ISIT 2016: 1093-1097 - [c81]Mani Bastani Parizi, Emre Telatar, Neri Merhav:
Exact random coding secrecy exponents for the wiretap channel. ISIT 2016: 1521-1525 - [c80]Neri Merhav:
The generalized stochastic likelihood decoder: Random coding and expurgated bounds. ISIT 2016: 2659-2663 - [i80]Mani Bastani Parizi, Emre Telatar, Neri Merhav:
Exact Random Coding Secrecy Exponents for the Wiretap Channel. CoRR abs/1601.04276 (2016) - [i79]Neri Merhav:
On empirical cumulant generating functions of code lengths for individual sequences. CoRR abs/1605.01182 (2016) - [i78]Nir Weinberger, Neri Merhav:
Lower Bounds on Parameter Modulation-Estimation Under Bandwidth Constraints. CoRR abs/1606.06576 (2016) - [i77]Neri Merhav:
Universal decoding using a noisy codebook. CoRR abs/1609.00549 (2016) - [i76]Ayse Ünsal, Raymond Knopp, Neri Merhav:
Converse Bounds on Modulation-Estimation Performance for the Gaussian Multiple-Access Channel. CoRR abs/1609.08300 (2016) - [i75]Neri Merhav:
Reliability of universal decoding based on vector-quantized codewords. CoRR abs/1609.08868 (2016) - [i74]Neri Merhav:
Relations Between Work and Entropy Production for General Information-Driven, Finite-State Engines. CoRR abs/1611.01965 (2016) - 2015
- [j154]Neri Merhav:
On Zero-Rate Error Exponents of Finite-State Channels With Input-Dependent States. IEEE Trans. Inf. Theory 61(2): 741-750 (2015) - [j153]Wasim Huleihel, Neri Merhav:
Universal Decoding for Gaussian Intersymbol Interference Channels. IEEE Trans. Inf. Theory 61(4): 1606-1618 (2015) - [j152]Nir Weinberger, Neri Merhav:
Optimum Tradeoffs Between the Error Exponent and the Excess-Rate Exponent of Variable-Rate Slepian-Wolf Coding. IEEE Trans. Inf. Theory 61(4): 2165-2190 (2015) - [j151]Neri Merhav:
Statistical Physics of Random Binning. IEEE Trans. Inf. Theory 61(5): 2454-2464 (2015) - [j150]Rami Atar, Neri Merhav:
Information-Theoretic Applications of the Logarithmic Probability Comparison Bound. IEEE Trans. Inf. Theory 61(10): 5366-5386 (2015) - [j149]Wasim Huleihel, Neri Merhav, Shlomo Shamai:
On Compressive Sensing in Coding Problems: A Rigorous Approach. IEEE Trans. Inf. Theory 61(10): 5727-5744 (2015) - [j148]Yonatan Kaspi, Neri Merhav:
Zero-Delay and Causal Secure Source Coding. IEEE Trans. Inf. Theory 61(11): 6238-6250 (2015) - [j147]Avraham Reani, Neri Merhav:
Universal Quantization for Separate Encodings and Joint Decoding of Correlated Sources. IEEE Trans. Inf. Theory 61(12): 6465-6474 (2015) - [c79]Rami Atar, Neri Merhav:
Information-theoretic applications of the logarithmic probability comparison bound. ISIT 2015: 735-739 - [c78]Neri Merhav:
Statistical physics of random binning. ISIT 2015: 1560-1564 - [c77]Nir Weinberger, Neri Merhav:
Optimum trade-offs between error exponent and excess-rate exponent of Slepian-Wolf coding. ISIT 2015: 1565-1569 - [c76]Nir Weinberger, Neri Merhav:
Simplified erasure/list decoding. ISIT 2015: 2226-2230 - [c75]Wasim Huleihel, Neri Merhav:
Universal decoding for Gaussian intersymbol interference channels. ISIT 2015: 2919-2923 - [c74]Nir Weinberger, Wasim Huleihel, Neri Merhav:
Erasure/list random coding error exponents are not universally achievable. ITW 2015: 1-5 - [c73]Benedetta Tondi, Mauro Barni, Neri Merhav:
Detection games with a fully active attacker. WIFS 2015: 1-6 - [i73]Wasim Huleihel, Neri Merhav:
Exact Random Coding Error Exponents for the Two-User Interference Channel. CoRR abs/1503.02389 (2015) - [i72]Neri Merhav:
Sequence complexity and work extraction. CoRR abs/1503.07653 (2015) - [i71]Nir Weinberger, Neri Merhav:
A Large Deviations Approach to Secure Lossy Compression. CoRR abs/1504.05756 (2015) - [i70]Neri Merhav:
Universal Decoding for Source-Channel Coding with Side Information. CoRR abs/1507.01255 (2015) - [i69]Nir Weinberger, Neri Merhav:
Channel Detection in Coded Communication. CoRR abs/1509.01806 (2015) - [i68]Neri Merhav:
The generalized likelihood decoder: random coding and expurgated bounds. CoRR abs/1512.01780 (2015) - 2014
- [j146]Neri Merhav:
Exponential Error Bounds on Parameter Modulation-Estimation for Discrete Memoryless Channels. IEEE Trans. Inf. Theory 60(2): 832-841 (2014) - [j145]Wasim Huleihel, Neri Merhav:
Analysis of Mismatched Estimation Errors Using Gradients of Partition Functions. IEEE Trans. Inf. Theory 60(4): 2190-2216 (2014) - [j144]Jonathan Scarlett, Li Peng, Neri Merhav, Alfonso Martinez, Albert Guillen i Fabregas:
Expurgated Random-Coding Ensembles: Exponents, Refinements, and Connections. IEEE Trans. Inf. Theory 60(8): 4449-4462 (2014) - [j143]Neri Merhav:
Erasure/List Exponents for Slepian-Wolf Decoding. IEEE Trans. Inf. Theory 60(8): 4463-4471 (2014) - [j142]Nir Weinberger, Neri Merhav:
Codeword or Noise? Exact Random Coding Exponents for Joint Detection and Decoding. IEEE Trans. Inf. Theory 60(9): 5077-5094 (2014) - [j141]Neri Merhav:
Exact Random Coding Error Exponents of Optimal Bin Index Decoding. IEEE Trans. Inf. Theory 60(10): 6024-6031 (2014) - [j140]Neri Merhav:
On the Data Processing Theorem in the Semi-deterministic Setting. IEEE Trans. Inf. Theory 60(10): 6032-6040 (2014) - [j139]Neri Merhav:
List Decoding - Random Coding Exponents and Expurgated Exponents. IEEE Trans. Inf. Theory 60(11): 6749-6759 (2014) - [j138]Neri Merhav:
Asymptotically Optimal Decision Rules for Joint Detection and Source Coding. IEEE Trans. Inf. Theory 60(11): 6787-6795 (2014) - [j137]Yonatan Kaspi, Neri Merhav:
Zero-Delay and Causal Single-User and Multi-User Lossy Source Coding with Decoder Side Information. IEEE Trans. Inf. Theory 60(11): 6931-6942 (2014) - [j136]Neri Merhav:
Erratum to "Exact Random Coding Error Exponents of Optimal Bin Index Decoding". IEEE Trans. Inf. Theory 60(11): 7388 (2014) - [j135]Neri Merhav:
Exact Correct-Decoding Exponent of the Wiretap Channel Decoder. IEEE Trans. Inf. Theory 60(12): 7606-7615 (2014) - [c72]Nir Weinberger, Neri Merhav:
Large deviations analysis of variable-rate Slepian-Wolf coding. ISIT 2014: 481-485 - [c71]Avraham Reani, Neri Merhav:
Universal quantization for separate encodings and joint decoding of correlated sources. ISIT 2014: 761-765 - [c70]Dror A. Vinkler, Haim H. Permuter, Neri Merhav:
Analogy between gambling and measurement-based work extraction. ISIT 2014: 1111-1115 - [c69]Neri Merhav:
List decoding - Random coding exponents and expurgated exponents. ISIT 2014: 2459-2463 - [c68]Nir Weinberger, Neri Merhav:
Codeword or noise? Exact random coding exponents for slotted asynchronism. ISIT 2014: 2509-2513 - [c67]Wasim Huleihel, Neri Merhav:
Asymptotic MMSE analysis under sparse representation modeling. ISIT 2014: 2634-2638 - [i67]Nir Weinberger, Neri Merhav:
Large Deviations Analysis of Variable-Rate Slepian-Wolf Coding. CoRR abs/1401.0892 (2014) - [i66]Wasim Huleihel, Neri Merhav:
Universal Decoding for Gaussian Intersymbol Interference Channels. CoRR abs/1403.3786 (2014) - [i65]Wasim Huleihel, Neri Merhav, Shlomo Shamai:
On Compressive Sensing in Coding Problems: A Rigorous Approach. CoRR abs/1403.5874 (2014) - [i64]Neri Merhav:
Exact correct-decoding exponent of the wiretap channel decoder. CoRR abs/1403.6143 (2014) - [i63]Dror A. Vinkler, Haim H. Permuter, Neri Merhav:
Analogy Between Gambling and Measurement-Based Work Extraction. CoRR abs/1404.6788 (2014) - [i62]Neri Merhav:
Exact random coding error exponents of optimal bin index decoding. CoRR abs/1404.7604 (2014) - [i61]Neri Merhav:
On zero-rate error exponents of finite-state channels with input-dependent states. CoRR abs/1406.7092 (2014) - [i60]Wasim Huleihel, Nir Weinberger, Neri Merhav:
Erasure/List Random Coding Error Exponents Are Not Universally Achievable. CoRR abs/1410.7005 (2014) - [i59]Avraham Reani, Neri Merhav:
Universal Quantization for Separate Encodings and Joint Decoding of Correlated Sources. CoRR abs/1411.3597 (2014) - [i58]Neri Merhav:
Statistical physics of random binning. CoRR abs/1411.3857 (2014) - [i57]Nir Weinberger, Neri Merhav:
Simplified Erasure/List Decoding. CoRR abs/1412.1964 (2014) - [i56]Rami Atar, Neri Merhav:
Information-theoretic applications of the logarithmic probability comparison bound. CoRR abs/1412.6769 (2014) - 2013
- [j134]Neri Merhav:
Perfectly Secure Encryption of Individual Sequences. IEEE Trans. Inf. Theory 59(3): 1302-1310 (2013) - [j133]Avraham Reani, Neri Merhav:
Data-Processing Bounds for Scalar Lossy Source Codes With Side Information at the Decoder. IEEE Trans. Inf. Theory 59(7): 4057-4070 (2013) - [j132]Neri Merhav:
Universal Decoding for Arbitrary Channels Relative to a Given Class of Decoding Metrics. IEEE Trans. Inf. Theory 59(9): 5566-5576 (2013) - [j131]Neri Merhav, Wojciech Szpankowski:
Average Redundancy of the Shannon Code for Markov Sources. IEEE Trans. Inf. Theory 59(11): 7186-7193 (2013) - [c66]Yonatan Kaspi, Neri Merhav:
The zero-delay Wyner-Ziv problem. ISIT 2013: 1352-1356 - [c65]Neri Merhav, Wojciech Szpankowski:
Average redundancy of the Shannon code for Markov sources. ISIT 2013: 1919-1923 - [c64]Neri Merhav:
Exponential error bounds on Parameter Modulation-Estimation for Memoryless Channels. ISIT 2013: 2835-2839 - [c63]Neri Merhav:
Erasure/list exponents for Slepian-Wolf decoding. ITW 2013: 1-5 - [i55]Yonatan Kaspi, Neri Merhav:
Zero-Delay and Causal Single-User and Multi-User Lossy Source Coding with Decoder Side Information. CoRR abs/1301.0079 (2013) - [i54]Neri Merhav:
Another look at expurgated bounds and their statistical-mechanical interpretation. CoRR abs/1301.4117 (2013) - [i53]Neri Merhav:
On the data processing theorem in the semi-deterministic setting. CoRR abs/1304.0183 (2013) - [i52]Neri Merhav:
Erasure/list exponents for Slepian-Wolf decoding. CoRR abs/1305.5626 (2013) - [i51]Wasim Huleihel, Neri Merhav:
Analysis of Mismatched Estimation Errors Using Gradients of Partition Functions. CoRR abs/1306.0094 (2013) - [i50]Jonathan Scarlett, Li Peng, Neri Merhav, Alfonso Martinez, Albert Guillen i Fabregas:
Expurgated Random-Coding Ensembles: Exponents, Refinements and Connections. CoRR abs/1307.6679 (2013) - [i49]Neri Merhav:
Codeword or noise? Exact random coding exponents for slotted asynchronism. CoRR abs/1308.4572 (2013) - [i48]Neri Merhav:
Asymptotically optimal decision rules for joint detection and source coding. CoRR abs/1310.4939 (2013) - [i47]Yonatan Kaspi, Neri Merhav:
Zero-Delay and Causal Secure Source Coding. CoRR abs/1311.4723 (2013) - [i46]Neri Merhav:
List decoding - random coding exponents and expurgated exponents. CoRR abs/1311.7298 (2013) - [i45]Wasim Huleihel, Neri Merhav:
Asymptotic MMSE Analysis Under Sparse Representation Modeling. CoRR abs/1312.3417 (2013) - 2012
- [j130]Neri Merhav:
Relations Between Redundancy Patterns of the Shannon Code and Wave Diffraction Patterns of Partially Disordered Media. IEEE Trans. Inf. Theory 58(6): 3402-3406 (2012) - [j129]Neri Merhav:
Data-Processing Inequalities Based on a Certain Structured Class of Information Measures With Application to Estimation Theory. IEEE Trans. Inf. Theory 58(8): 5287-5301 (2012) - [j128]Yonatan Kaspi, Neri Merhav:
Structure Theorems for Real-Time Variable Rate Coding With and Without Side Information. IEEE Trans. Inf. Theory 58(12): 7135-7153 (2012) - [j127]Neri Merhav:
On Optimum Parameter Modulation-Estimation From a Large Deviations Perspective. IEEE Trans. Inf. Theory 58(12): 7215-7225 (2012) - [c62]Avraham Reani, Neri Merhav:
Data processing lower bounds for scalar lossy source codes with side information at the decoder. ISIT 2012: 1-5 - [c61]Neri Merhav:
On optimum strategies for minimizing the exponential moments of a loss function. ISIT 2012: 140-144 - [c60]Yonatan Kaspi, Neri Merhav:
On real-time and causal secure source coding. ISIT 2012: 353-357 - [c59]Neri Merhav:
Relations between redundancy patterns of the Shannon code and wave diffraction patterns of partially disordered media. ISIT 2012: 925-929 - [c58]Neri Merhav:
Data processing inequalities based on a certain structured class of information measures with application to estimation theory. ISIT 2012: 1271-1275 - [c57]Neri Merhav:
Perfectly secure encryption of individual sequences. ISIT 2012: 1588-1592 - [c56]Erez Sabbag, Neri Merhav:
Error exponents of optimum erasure/list and ordinary decoding for channels with side information. ISIT 2012: 2939-2943 - [i44]Neri Merhav:
On optimum parameter modulation-estimation from a large deviations perspective. CoRR abs/1203.4358 (2012) - [i43]Yonatan Kaspi, Neri Merhav:
On Real-Time and Causal Secure Source Coding. CoRR abs/1205.3378 (2012) - [i42]Neri Merhav, Wojciech Szpankowski:
Average redundancy of the Shannon code for Markov sources. CoRR abs/1208.1225 (2012) - [i41]Avraham Reani, Neri Merhav:
Data Processing Bounds for Scalar Lossy Source Codes with Side Information at the Decoder. CoRR abs/1209.2066 (2012) - [i40]Neri Merhav:
Universal decoding for arbitrary channels relative to a given class of decoding metrics. CoRR abs/1210.6764 (2012) - [i39]Neri Merhav:
Exponential error bounds on parameter modulation-estimation for discrete memoryless channels. CoRR abs/1212.4649 (2012) - 2011
- [j126]Neri Merhav:
On optimum strategies for minimizing the exponential moments of a loss function. Commun. Inf. Syst. 11(4): 343-368 (2011) - [j125]Yonatan Kaspi, Neri Merhav:
Error Exponents for Broadcast Channels With Degraded Message Sets. IEEE Trans. Inf. Theory 57(1): 101-123 (2011) - [j124]Neri Merhav:
Rate-Distortion Function via Minimum Mean Square Error Estimation. IEEE Trans. Inf. Theory 57(6): 3196-3206 (2011) - [j123]Neri Merhav:
Optimum Estimation via Gradients of Partition Functions and Information Measures: A Statistical-Mechanical Perspective. IEEE Trans. Inf. Theory 57(6): 3887-3898 (2011) - [j122]Neri Merhav:
Data Processing Theorems and the Second Law of Thermodynamics. IEEE Trans. Inf. Theory 57(8): 4926-4939 (2011) - [j121]Anelia Somekh-Baruch, Neri Merhav:
Exact Random Coding Exponents for Erasure Decoding. IEEE Trans. Inf. Theory 57(10): 6444-6454 (2011) - [j120]Avraham Reani, Neri Merhav:
Efficient On-Line Schemes for Encoding Individual Sequences With Side Information at the Decoder. IEEE Trans. Inf. Theory 57(10): 6860-6876 (2011) - [j119]Neri Merhav:
Threshold Effects in Parameter Estimation as Phase Transitions in Statistical Mechanics. IEEE Trans. Inf. Theory 57(10): 7000-7010 (2011) - [c55]Yonatan Kaspi, Neri Merhav:
Structure theorems for real-time variable rate coding with side information. Allerton 2011: 172-179 - [c54]Neri Merhav:
Threshold effects in parameter estimation as phase transitions in statistical physics. ITW 2011: 603-607 - [i38]Neri Merhav:
On optimum strategies for minimizing the exponential moments of a given cost function. CoRR abs/1103.2882 (2011) - [i37]Neri Merhav:
Relations between redundancy patterns of the Shannon code and wave diffraction patterns of partially disordered media. CoRR abs/1104.0384 (2011) - [i36]Neri Merhav:
Subset sum phase transitions and data compression. CoRR abs/1107.2757 (2011) - [i35]Yonatan Kaspi, Neri Merhav:
Structure Theorems for Real-Time Variable-Rate Coding With and Without Side Information. CoRR abs/1108.2881 (2011) - [i34]Neri Merhav:
Data processing inequalities based on a certain structured class of information measures with application to estimation theory. CoRR abs/1109.5351 (2011) - [i33]Neri Merhav:
Perfectly secure encryption of individual sequences. CoRR abs/1112.2262 (2011) - 2010
- [j118]Neri Merhav:
Statistical Physics and Information Theory. Found. Trends Commun. Inf. Theory 6(1-2): 1-212 (2010) - [j117]Raúl Hernán Etkin, Neri Merhav, Erik Ordentlich:
Error exponents of optimum decoding for the interference channel. IEEE Trans. Inf. Theory 56(1): 40-56 (2010) - [j116]Neri Merhav:
On the statistical physics of directed polymers in a random medium and their relation to tree codes. IEEE Trans. Inf. Theory 56(3): 1345-1350 (2010) - [j115]Neri Merhav, Dongning Guo, Shlomo Shamai:
Statistical physics of signal estimation in Gaussian noise: theory and examples of phase transitions. IEEE Trans. Inf. Theory 56(3): 1400-1416 (2010) - [j114]Pedro Comesaña, Neri Merhav, Mauro Barni:
Asymptotically optimum universal watermark embedding and detection in the high-SNR regime. IEEE Trans. Inf. Theory 56(6): 2804-2815 (2010) - [j113]Alina Maor, Neri Merhav:
On successive refinement for the Kaspi/Heegard-Berger problem. IEEE Trans. Inf. Theory 56(8): 3930-3945 (2010) - [j112]Alvaro Martín, Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger:
Twice-universal simulation of Markov sources and individual sequences. IEEE Trans. Inf. Theory 56(9): 4245-4255 (2010) - [j111]Neri Merhav:
Physics of the shannon limits. IEEE Trans. Inf. Theory 56(9): 4274-4285 (2010) - [j110]Erez Sabbag, Neri Merhav:
Achievable Error Exponents for Channels With Side Information - Erasure and List Decoding. IEEE Trans. Inf. Theory 56(11): 5424-5431 (2010) - [c53]Neri Merhav:
On the physics of rate-distortion theory. ISIT 2010: 71-75 - [c52]Yonatan Kaspi, Neri Merhav:
Structure theorem for real-time variable-rate lossy source encoders and memory-limited decoders with side information. ISIT 2010: 86-90 - [c51]Anelia Somekh-Baruch, Neri Merhav:
Exact random coding exponents for erasure decoding. ISIT 2010: 260-264 - [c50]Neri Merhav:
Optimum estimation via partition functions and information measures. ISIT 2010: 1473-1477 - [i32]Neri Merhav:
Rate-distortion function via minimum mean square error estimation. CoRR abs/1004.5189 (2010) - [i31]Neri Merhav:
Threshold effects in parameter estimation as phase transitions in statistical mechanics. CoRR abs/1005.3620 (2010) - [i30]Neri Merhav:
Information Theory and Statistical Physics - Lecture Notes. CoRR abs/1006.1565 (2010) - [i29]Neri Merhav:
Data processing theorems and the second law of thermodynamics. CoRR abs/1007.2827 (2010) - [i28]Neri Merhav:
A statistical-mechanical view on source coding: physical compression and data compression. CoRR abs/1011.3516 (2010)
2000 – 2009
- 2009
- [j109]Neri Merhav:
Relations Between Random Coding Exponents and the Statistical Physics of Random Codes. IEEE Trans. Inf. Theory 55(1): 83-92 (2009) - [j108]Neri Merhav, Marcelo J. Weinberger:
Universal Simulation With Fidelity Criteria. IEEE Trans. Inf. Theory 55(1): 292-302 (2009) - [j107]Neri Merhav:
The Generalized Random Energy Model and its Application to the Statistical Physics of Ensembles of Hierarchical Codes. IEEE Trans. Inf. Theory 55(3): 1250-1268 (2009) - [j106]Yaniv Akirav, Neri Merhav:
Exact Characterization of the Minimax Loss in Error Exponents of Universal Decoders. IEEE Trans. Inf. Theory 55(4): 1440-1459 (2009) - [j105]Neri Merhav:
Joint source channel coding via statistical mechanics: thermal equilibrium between the source and the channel. IEEE Trans. Inf. Theory 55(12): 5382-5393 (2009) - [c49]Neri Merhav:
On the statistical physics of directed polymers in a random medium and their relation to tree codes. ISIT 2009: 354-358 - [c48]Avraham Reani, Neri Merhav:
Efficient on-line schemes for encoding individual sequences with side information at the decoder. ISIT 2009: 1025-1029 - [c47]Neri Merhav:
Joint source-channel coding via statistical mechanics: Thermal equilibrium between the source and the channel. ISIT 2009: 2136-2140 - [c46]Yonatan Kaspi, Neri Merhav:
Error exponents of optimum decoding for the degraded broadcast channel using moments of type class enumerators. ISIT 2009: 2507-2511 - [i27]Neri Merhav:
Physics of the Shannon Limits. CoRR abs/0903.1484 (2009) - [i26]Erez Sabbag, Neri Merhav:
Achievable Error Exponents for Channel with Side Information - Erasure and List Decoding. CoRR abs/0903.2203 (2009) - [i25]Yonatan Kaspi, Neri Merhav:
Error Exponents for Broadcast Channels with Degraded Message Sets. CoRR abs/0906.1339 (2009) - [i24]Avraham Reani, Neri Merhav:
Efficient On-line Schemes for Encoding Individual Sequences with Side Information at the Decoder. CoRR abs/0908.1510 (2009) - [i23]Neri Merhav:
Another Look at the Physics of Large Deviations With Application to Rate-Distortion Theory. CoRR abs/0908.3562 (2009) - [i22]Neri Merhav:
Optimum estimation via gradients of partition functions and information measures: a statistical-mechanical perspective. CoRR abs/0911.3213 (2009) - 2008
- [j104]Angela D'Angelo, Mauro Barni, Neri Merhav:
Stochastic Image Warping for Improved Watermark Desynchronization. EURASIP J. Inf. Secur. 2008 (2008) - [j103]Neri Merhav, Erez Sabbag:
Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources. IEEE Trans. Inf. Theory 54(1): 255-274 (2008) - [j102]Alina Maor, Neri Merhav:
On Successive Refinement With Causal Side Information at the Decoders. IEEE Trans. Inf. Theory 54(1): 332-343 (2008) - [j101]Neri Merhav:
Shannon's Secrecy System With Informed Receivers and its Application to Systematic Coding for Wiretapped Channels. IEEE Trans. Inf. Theory 54(6): 2723-2734 (2008) - [j100]Neri Merhav:
An Identity of Chernoff Bounds With an Interpretation in Statistical Physics and Applications in Information Theory. IEEE Trans. Inf. Theory 54(8): 3710-3721 (2008) - [j99]Neri Merhav:
Error Exponents of Erasure/List Decoding Revisited Via Moments of Distance Enumerators. IEEE Trans. Inf. Theory 54(10): 4439-4447 (2008) - [j98]Anelia Somekh-Baruch, Neri Merhav:
Correction to "On the Capacity Game of Private Fingerprinting Systems Under Collusion Attacks" [Mar 05 884-899]. IEEE Trans. Inf. Theory 54(11): 5263-5264 (2008) - [j97]Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger:
Universal Delay-Limited Simulation. IEEE Trans. Inf. Theory 54(12): 5525-5533 (2008) - [j96]Asaf Cohen, Tsachy Weissman, Neri Merhav:
Scanning and Sequential Decision Making for Multidimensional Data - Part II: The Noisy Case. IEEE Trans. Inf. Theory 54(12): 5609-5631 (2008) - [c45]Neri Merhav:
An identity of Chernoff bounds with an interpretation in statistical physics and applications in information theory. ISIT 2008: 499-503 - [c44]Neri Merhav:
Relations between random coding exponents and the statistical physics of random codes. ISIT 2008: 504-508 - [c43]Gilad Bukai, Neri Merhav:
Channel estimation using feedback. ISIT 2008: 1243-1247 - [c42]Yonatan Kaspi, Neri Merhav:
Error exponents for degraded broadcast channels with degraded message sets. ISIT 2008: 1518-1522 - [c41]Raúl H. Etkin, Neri Merhav, Erik Ordentlich:
Error exponents of optimum decoding for the interference channel. ISIT 2008: 1523-1527 - [c40]Yaniv Akirav, Neri Merhav:
Exact characterization of the minimax loss in error exponents of universal decoders. ISIT 2008: 1773-1777 - [c39]Erez Sabbag, Neri Merhav:
Achievable error exponents for channel with side information - erasure and list decoding. ISIT 2008: 1778-1782 - [c38]Pedro Comesaña, Neri Merhav, Mauro Barni:
Asymptotically optimum embedding strategy for one-bit watermarking under Gaussian attacks. Security, Forensics, Steganography, and Watermarking of Multimedia Contents 2008: 681909 - [i21]Pedro Comesaña, Neri Merhav, Mauro Barni:
Asymptotically Optimum Universal One-Bit Watermarking for Gaussian Covertexts and Gaussian Attacks. CoRR abs/0803.3880 (2008) - [i20]Raúl H. Etkin, Neri Merhav, Erik Ordentlich:
Error Exponents of Optimum Decoding for the Interference Channel. CoRR abs/0810.1980 (2008) - [i19]Neri Merhav:
Joint source-channel coding via statistical mechanics: thermal equilibrium between the source and the channel. CoRR abs/0810.2164 (2008) - [i18]Neri Merhav:
On the statistical physics of directed polymers in a random medium and their relation to tree codes. CoRR abs/0812.2454 (2008) - [i17]Alina Maor, Neri Merhav:
On Successive Refinement for the Kaspi/Heegard-Berger Problem. CoRR abs/0812.3285 (2008) - [i16]Neri Merhav, Dongning Guo, Shlomo Shamai:
Statistical Physics of Signal Estimation in Gaussian Noise: Theory and Examples of Phase Transitions. CoRR abs/0812.4889 (2008) - 2007
- [j95]Guy Keshet, Yossef Steinberg, Neri Merhav:
Channel Coding in the Presence of Side Information. Found. Trends Commun. Inf. Theory 4(6): 445-586 (2007) - [j94]Tsachy Weissman, Erik Ordentlich, Marcelo J. Weinberger, Anelia Somekh-Baruch, Neri Merhav:
Universal Filtering Via Prediction. IEEE Trans. Inf. Theory 53(4): 1253-1264 (2007) - [j93]Neri Merhav, Meir Feder:
Minimax Universal Decoding With an Erasure Option. IEEE Trans. Inf. Theory 53(5): 1664-1675 (2007) - [j92]Anelia Somekh-Baruch, Neri Merhav:
Achievable Error Exponents for the Private Fingerprinting Game. IEEE Trans. Inf. Theory 53(5): 1827-1838 (2007) - [j91]Jacob Ziv, Neri Merhav:
On Context-Tree Prediction of Individual Sequences. IEEE Trans. Inf. Theory 53(5): 1860-1866 (2007) - [j90]Neri Merhav, Shlomo Shamai:
Information Rates Subject to State Masking. IEEE Trans. Inf. Theory 53(6): 2254-2261 (2007) - [j89]Asaf Cohen, Neri Merhav, Tsachy Weissman:
Scanning and Sequential Decision Making for Multidimensional Data-Part I: The Noiseless Case. IEEE Trans. Inf. Theory 53(9): 3001-3020 (2007) - [c37]Asaf Cohen, Neri Merhav, Tsachy Weissman:
Scanning, Filtering and Prediction for Random Fields Corrupted by Gaussian Noise. ISIT 2007: 691-695 - [c36]Alina Maor, Neri Merhav:
On Successive Refinement for the Kaspi/Heegard-Berger Problem. ISIT 2007: 1466-1470 - [c35]Neri Merhav, Meir Feder:
Universal Decoding With an Erasure Option. ISIT 2007: 1726-1730 - [c34]Erez Sabbag, Neri Merhav:
Optimal Watermark Embedding and Detection Strategies Under General Worst Case Attacks. ISIT 2007: 2446-2450 - [c33]Neri Merhav:
Shannon's Secrecy System With Informed Receivers and its Application to Systematic Coding for Wiretapped Channels. ISIT 2007: 2481-2485 - [c32]Alvaro Martín, Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger:
Twice-Universal Simulation of Markov Sources and Individual Sequences. ISIT 2007: 2876-2880 - [c31]Mauro Barni, Angela D'Angelo, Neri Merhav:
Expanding the class of watermark de-synchronization attacks. MM&Sec 2007: 195-204 - [i15]Neri Merhav, Erez Sabbag:
Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources. CoRR abs/0705.1919 (2007) - [i14]Asaf Cohen, Tsachy Weissman, Neri Merhav:
Scanning and Sequential Decision Making for Multi-Dimensional Data - Part II: the Noisy Case. CoRR abs/0705.2854 (2007) - [i13]Yaniv Akirav, Neri Merhav:
Competitive minimax universal decoding for several ensembles of random codes. CoRR abs/0707.4507 (2007) - [i12]Neri Merhav:
Relations between random coding exponents and the statistical physics of random codes. CoRR abs/0708.0850 (2007) - [i11]Neri Merhav:
Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators. CoRR abs/0711.2501 (2007) - [i10]Neri Merhav:
The Generalized Random Energy Model and its Application to the Statistical Physics of Ensembles of Hierarchical Codes. CoRR abs/0712.4209 (2007) - [i9]Neri Merhav:
An identity of Chernoff bounds with an interpretation in statistical physics and applications in information theory. CoRR abs/cs/0702101 (2007) - 2006
- [j88]Neri Merhav:
On joint coding for watermarking and encryption. IEEE Trans. Inf. Theory 52(1): 190-205 (2006) - [j87]Neri Merhav, Erik Ordentlich:
On causal and semicausal codes for joint information embedding and source coding. IEEE Trans. Inf. Theory 52(1): 213-226 (2006) - [j86]Neri Merhav, Jacob Ziv:
On the Wyner-Ziv problem for individual sequences. IEEE Trans. Inf. Theory 52(3): 867-873 (2006) - [j85]Yossef Steinberg, Neri Merhav:
On hierarchical joint source-channel coding with degraded side information. IEEE Trans. Inf. Theory 52(3): 886-903 (2006) - [j84]Neri Merhav:
On the shannon cipher system with a capacity-limited key-distribution channel. IEEE Trans. Inf. Theory 52(3): 1269-1273 (2006) - [j83]Alina Maor, Neri Merhav:
Two-way successively refined joint source-channel coding. IEEE Trans. Inf. Theory 52(4): 1483-1494 (2006) - [j82]Neri Merhav, Tsachy Weissman:
Coding for the Feedback Gel'fand-Pinsker Channel and the Feedforward Wyner-Ziv Source. IEEE Trans. Inf. Theory 52(9): 4207-4211 (2006) - [c30]Erez Sabbag, Neri Merhav:
Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources. ISIT 2006: 173-177 - [c29]Asaf Cohen, Neri Merhav, Tsachy Weissman:
Universal Scanning and Sequential Decision Making for Multidimensional Data. ISIT 2006: 431-435 - [c28]Neri Merhav, Shlomo Shamai:
Information Rates Subjected to State Masking. ISIT 2006: 1184-1188 - [c27]Alina Maor, Neri Merhav:
On Hierarchical Joint Source-Channel Coding With Causal Side Information at the Decoders. ISIT 2006: 2148-2152 - [c26]Neri Merhav, Marcelo J. Weinberger:
Universal Simulation with a Fidelity Criterion. ISIT 2006: 2521-2525 - [c25]Jacob Ziv, Neri Merhav:
On Context - Tree Prediction of Individual Sequences. ITW 2006: 232-236 - [i8]Neri Merhav, Meir Feder:
Universal decoding with an erasure option. CoRR abs/cs/0604069 (2006) - [i7]Asaf Cohen, Neri Merhav, Tsachy Weissman:
Scanning and Sequential Decision Making for Multi-Dimensional Data - Part I: the Noiseless Case. CoRR abs/cs/0609049 (2006) - [i6]Neri Merhav:
Shannon's secrecy system with informed receivers and its application to systematic coding for wiretapped channels. CoRR abs/cs/0611129 (2006) - 2005
- [j81]Anelia Somekh-Baruch, Neri Merhav:
On the capacity game of private fingerprinting systems under collusion attacks. IEEE Trans. Inf. Theory 51(3): 884-899 (2005) - [j80]Alina Maor, Neri Merhav:
On joint information embedding and lossy compression. IEEE Trans. Inf. Theory 51(8): 2998-3008 (2005) - [j79]Alina Maor, Neri Merhav:
On Joint Information Embedding and Lossy Compression in the Presence of a Stationary Memoryless Attack Channel. IEEE Trans. Inf. Theory 51(9): 3166-3175 (2005) - [j78]Neri Merhav, Marcelo J. Weinberger:
Addendum to "On Universal Simulation of Information Sources Using Training Data. IEEE Trans. Inf. Theory 51(9): 3381-3383 (2005) - [j77]Ilan Hen, Neri Merhav:
On the error exponent of trellis source coding. IEEE Trans. Inf. Theory 51(11): 3734-3741 (2005) - [j76]Tsachy Weissman, Neri Merhav:
On causal source codes with side information. IEEE Trans. Inf. Theory 51(11): 4003-4013 (2005) - [j75]Yonina C. Eldar, Neri Merhav:
Minimax MSE-ratio estimation with signal covariance uncertainties. IEEE Trans. Signal Process. 53(4): 1335-1347 (2005) - [c24]Neri Merhav:
On Joint Coding for Watermarking and Encryption. Information Hiding 2005: 1-10 - [c23]Alina Maor, Neri Merhav:
Two-way joint source-channel coding with a fidelity criterion. ISIT 2005: 631-635 - [c22]Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger:
Universal delay-limited simulation. ISIT 2005: 765-769 - [c21]Neri Merhav, Tsachy Weissman:
Coding for the feedback Gel'fand-Pinsker channel and the feedforward Wyner-Ziv source. ISIT 2005: 1506-1510 - [c20]Ilan Hen, Neri Merhav:
On the error exponent of trellis source coding. ISIT 2005: 1922-1926 - [i5]Neri Merhav, Jacob Ziv:
On the Wyner-Ziv problem for individual sequences. CoRR abs/cs/0505010 (2005) - [i4]Neri Merhav:
On the Shannon cipher system with a capacity-limited key-distribution channel. CoRR abs/cs/0505012 (2005) - [i3]Jacob Ziv, Neri Merhav:
On context-tree prediction of individual sequences. CoRR abs/cs/0508127 (2005) - [i2]Neri Merhav, Tsachy Weissman:
Coding for the feedback Gel'fand-Pinsker channel and the feedforward Wyner-Ziv source. CoRR abs/cs/0509039 (2005) - [i1]Neri Merhav:
On joint coding for watermarking and encryption. CoRR abs/cs/0509064 (2005) - 2004
- [j74]Neri Merhav, Marcelo J. Weinberger:
On universal simulation of information sources using training data. IEEE Trans. Inf. Theory 50(1): 5-20 (2004) - [j73]Neri Merhav:
Achievable key rates for universal simulation of random data with respect to a set of statistical tests. IEEE Trans. Inf. Theory 50(1): 21-30 (2004) - [j72]Asaf Cohen, Neri Merhav:
Lower bounds on the error probability of block codes based on improvements on de Caen's inequality. IEEE Trans. Inf. Theory 50(2): 290-310 (2004) - [j71]Anelia Somekh-Baruch, Neri Merhav:
On the capacity game of public watermarking systems. IEEE Trans. Inf. Theory 50(3): 511-524 (2004) - [j70]Yossef Steinberg, Neri Merhav:
On Successive Refinement for the Wyner-Ziv Problem. IEEE Trans. Inf. Theory 50(8): 1636-1654 (2004) - [j69]Ilan Hen, Neri Merhav:
On the Threshold Effect in the Estimation of Chaotic Sequences. IEEE Trans. Inf. Theory 50(11): 2894-2904 (2004) - [j68]Yonina C. Eldar, Neri Merhav:
A competitive minimax approach to robust estimation of random parameters. IEEE Trans. Signal Process. 52(7): 1931-1946 (2004) - [c19]Erik Ordentlich, Tsachy Weissman, Marcelo J. Weinberger, Anelia Somekh-Baruch, Neri Merhav:
Discrete Universal Filtering Through Incremental Parsing. Data Compression Conference 2004: 352-361 - [c18]Erez Sabbag, Neri Merhav:
Large deviations performance of predictors for Markov sources. ISIT 2004: 11 - [c17]Alina Maor, Neri Merhav:
On joint information embedding and lossy compression. ISIT 2004: 194 - [c16]Neri Merhav, Erik Ordentlich:
On causal and semicausal codes for joint information embedding and source coding. ISIT 2004: 196 - [c15]Yossef Steinberg, Neri Merhav:
On successive refinement for the Wyner-Ziv problem. ISIT 2004: 362 - [c14]Yossef Steinberg, Neri Merhav:
On hierarchical joint source-channel coding. ISIT 2004: 363 - [c13]Anelia Somekh-Baruch, Neri Merhav:
On the random coding error exponents of the single-user and the multiple-access Gel'fand-Pinsker channels. ISIT 2004: 448 - 2003
- [j67]Neri Merhav, Tsachy Weissman:
Scanning and prediction in multidimensional data arrays. IEEE Trans. Inf. Theory 49(1): 65-82 (2003) - [j66]Neri Merhav:
A large-deviations notion of perfect secrecy. IEEE Trans. Inf. Theory 49(2): 506-508 (2003) - [j65]Anelia Somekh-Baruch, Neri Merhav:
On the error exponent and capacity games of private watermarking systems. IEEE Trans. Inf. Theory 49(3): 537-562 (2003) - [j64]Neri Merhav, Ioannis Kontoyiannis:
Source coding exponents for zero-delay coding with finite memory. IEEE Trans. Inf. Theory 49(3): 609-625 (2003) - [j63]Neri Merhav, Shlomo Shamai:
On joint source-channel coding for the Wyner-Ziv source and the Gel'fand-Pinsker channel. IEEE Trans. Inf. Theory 49(11): 2844-2855 (2003) - [j62]Tsachy Weissman, Neri Merhav:
On competitive prediction and its relation to rate-distortion theory. IEEE Trans. Inf. Theory 49(12): 3185-3194 (2003) - 2002
- [j61]Tsachy Weissman, Neri Merhav:
Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding. IEEE Trans. Inf. Theory 48(2): 396-415 (2002) - [j60]Tsachy Weissman, Neri Merhav:
On limited-delay lossy coding and filtering of individual sequences. IEEE Trans. Inf. Theory 48(3): 721-733 (2002) - [j59]Meir Feder, Neri Merhav:
Universal composite hypothesis testing: A competitive minimax approach. IEEE Trans. Inf. Theory 48(6): 1504-1517 (2002) - [j58]Yariv Ephraim, Neri Merhav:
Hidden Markov processes. IEEE Trans. Inf. Theory 48(6): 1518-1569 (2002) - [j57]Neri Merhav, Erik Ordentlich, Gadiel Seroussi, Marcelo J. Weinberger:
On sequential strategies for loss functions with memory. IEEE Trans. Inf. Theory 48(7): 1947-1958 (2002) - [j56]Evgeny Levitan, Neri Merhav:
A competitive Neyman-Pearson approach to universal hypothesis testing with applications. IEEE Trans. Inf. Theory 48(8): 2215-2229 (2002) - 2001
- [j55]Yossef Steinberg, Neri Merhav:
Identification in the presence of side information with application to watermarking. IEEE Trans. Inf. Theory 47(4): 1410-1422 (2001) - [j54]Tsachy Weissman, Neri Merhav, Anelia Somekh-Baruch:
Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence. IEEE Trans. Inf. Theory 47(5): 1849-1866 (2001) - [j53]Tsachy Weissman, Neri Merhav:
Universal prediction of individual binary sequences in the presence of noise. IEEE Trans. Inf. Theory 47(6): 2151-2173 (2001) - 2000
- [j52]Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger:
Optimal prefix codes for sources with two-sided geometric distributions. IEEE Trans. Inf. Theory 46(1): 121-135 (2000) - [j51]Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger:
Coding of sources with two-sided geometric distributions and unknown parameters. IEEE Trans. Inf. Theory 46(1): 229-236 (2000) - [j50]Neri Merhav:
On random coding error exponents of watermarking systems. IEEE Trans. Inf. Theory 46(2): 420-430 (2000) - [j49]Neri Merhav:
Universal detection of messages via finite-state channels. IEEE Trans. Inf. Theory 46(6): 2242-2246 (2000)
1990 – 1999
- 1999
- [j48]Neri Merhav:
Multiplication-free approximate algorithms for compressed-domain linear operations on images. IEEE Trans. Image Process. 8(2): 247-254 (1999) - [j47]Renato Kresch, Neri Merhav:
Fast DCT domain filtering using the DCT and the DST. IEEE Trans. Image Process. 8(6): 821-833 (1999) - [j46]Neri Merhav, Ron M. Roth, Erdal Arikan:
Hierarchical Guessing with a Fidelity Criterion. IEEE Trans. Inf. Theory 45(1): 330-337 (1999) - [j45]Gil I. Shamir, Neri Merhav:
Low-complexity sequential lossless coding for piecewise-stationary memoryless sources. IEEE Trans. Inf. Theory 45(5): 1498-1519 (1999) - [j44]Neri Merhav, Erdal Arikan:
The Shannon cipher system with a guessing wiretapper. IEEE Trans. Inf. Theory 45(6): 1860-1866 (1999) - [c12]Tsachy Weissman, Neri Merhav:
On Prediction of Individual Sequences Relative to a Set of Experts in the Presence of Noise. COLT 1999: 19-28 - [c11]Neri Merhav, Vasudev Bhaskaran:
A Multiplication-Free Approximate Algorithm for the Inverse Discrete Cosine Transform. ICIP (2) 1999: 759-763 - 1998
- [j43]Neri Merhav, Renato Kresch:
Approximate convolution using DCT coefficient multipliers. IEEE Trans. Circuits Syst. Video Technol. 8(4): 378-385 (1998) - [j42]Erdal Arikan, Neri Merhav:
Guessing Subject to Distortion. IEEE Trans. Inf. Theory 44(3): 1041-1056 (1998) - [j41]Erdal Arikan, Neri Merhav:
Joint Source-Channel Coding and Guessing with Application to Sequential Decoding. IEEE Trans. Inf. Theory 44(5): 1756-1769 (1998) - [j40]Neri Merhav, Meir Feder:
Universal Prediction. IEEE Trans. Inf. Theory 44(6): 2124-2147 (1998) - [j39]Yariv Ephraim, Neri Merhav, Harry L. Van Trees:
Authors' reply to "Comments on 'Min-Norm interpretations and consistency of MUSIC, MODE, and ML'". IEEE Trans. Signal Process. 46(11): 3104 (1998) - [c10]Bhaskaran Vasudev, Neri Merhav:
DCT mode conversions for field/frame coded MPEG video. MMSP 1998: 605-610 - 1997
- [j38]Neri Merhav, Vasudev Bhaskaran:
Fast algorithms for DCT-domain image downsampling and for inverse motion compensation. IEEE Trans. Circuits Syst. Video Technol. 7(3): 468-476 (1997) - [j37]Neri Merhav:
On list size exponents in rate-distortion coding. IEEE Trans. Inf. Theory 43(2): 765-769 (1997) - [j36]Neri Merhav, Jacob Ziv:
On the amount of statistical side information required for lossy data compression. IEEE Trans. Inf. Theory 43(4): 1112-1121 (1997) - [j35]Neri Merhav:
How many information bits does a decoder need about the channel statistics? IEEE Trans. Inf. Theory 43(5): 1707-1714 (1997) - 1996
- [j34]Neri Merhav, Bhaskaran Vasudev:
Fast Inverse Motion Compensation Algorithms for MPEG and for Partial DCT Information. J. Vis. Commun. Image Represent. 7(4): 395-410 (1996) - [j33]Meir Feder, Neri Merhav:
Hierarchical universal coding. IEEE Trans. Inf. Theory 42(5): 1354-1364 (1996) - [j32]J. J. Stein, Jacob Ziv, Neri Merhav:
Universal delay estimation for discrete channels. IEEE Trans. Inf. Theory 42(6): 2085-2093 (1996) - [j31]David Hirshberg, Neri Merhav:
Robust methods for model order estimation. IEEE Trans. Signal Process. 44(3): 620-628 (1996) - [c9]Neri Merhav, Vasudev Bhaskaran:
A fast algorithm for DCT-domain inverse motion compensation. ICASSP 1996: 2307-2310 - [c8]Neri Merhav, Vasudev Bhaskaran:
A transform domain approach to spatial domain image scaling. ICASSP 1996: 2403-2406 - [c7]Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger:
Modeling and low-complexity adaptive coding for image prediction residuals. ICIP (2) 1996: 353-356 - 1995
- [j30]Ronny Meir, Neri Merhav:
On the Stochastic Complexity of Learning Realizable and Unrealizable Rules. Mach. Learn. 19(3): 241-261 (1995) - [j29]Neri Merhav, Meir Feder:
A strong version of the redundancy-capacity theorem of universal coding. IEEE Trans. Inf. Theory 41(3): 714-722 (1995) - [j28]Neri Merhav:
A comment on 'A rate of convergence result for a universal D-semifaithful code'. IEEE Trans. Inf. Theory 41(4): 1200-1202 (1995) - [j27]Yariv Ephraim, Neri Merhav, Harry L. Van Trees:
Min-norm interpretations and consistency of MUSIC, MODE and ML. IEEE Trans. Signal Process. 43(12): 2937-2942 (1995) - [c6]Meir Feder, Neri Merhav:
Universal Coding for Arbitrarily Varying Sources and for Hierarchies of Model Classes. Data Compression Conference 1995: 82-91 - 1994
- [j26]Meir Feder, Neri Merhav:
Relations between entropy and error probability. IEEE Trans. Inf. Theory 40(1): 259-266 (1994) - [j25]Meir Feder, Neri Merhav, Michael Gutman:
Correction to 'Universal prediction of individual sequences' (Jul 92 1258-1270). IEEE Trans. Inf. Theory 40(1): 285 (1994) - [j24]Marcelo J. Weinberger, Neri Merhav, Meir Feder:
Optimal sequential probability assignment for individual sequences. IEEE Trans. Inf. Theory 40(2): 384-396 (1994) - [j23]Neri Merhav:
Bounds on achievable convergence rates of parameter estimators via universal coding. IEEE Trans. Inf. Theory 40(4): 1210-1215 (1994) - [j22]Neri Merhav, Gideon Kaplan, Amos Lapidoth, Shlomo Shamai:
On information rates for mismatched decoders. IEEE Trans. Inf. Theory 40(6): 1953-1967 (1994) - [c5]Neri Merhav, Meir Feder:
The Minimax Redundancy is a Lower Bound for Most Sources. Data Compression Conference 1994: 52-61 - [c4]Amir Shatz, Neri Merhav:
A non-parametric minimax approach for robust speech recognition. ICPR (3) 1994: 15-19 - 1993
- [j21]Neri Merhav, Chin-Hui Lee:
A minimax classification approach with application to robust speech recognition. IEEE Trans. Speech Audio Process. 1(1): 90-100 (1993) - [j20]Neri Merhav, Meir Feder, Michael Gutman:
Some properties of sequential predictors for binary Markov sources. IEEE Trans. Inf. Theory 39(3): 887-892 (1993) - [j19]Neri Merhav:
Universal decoding for memoryless Gaussian channels with a deterministic interference. IEEE Trans. Inf. Theory 39(4): 1261-1269 (1993) - [j18]Jacob Ziv, Neri Merhav:
A measure of relative entropy between individual sequences with application to universal classification. IEEE Trans. Inf. Theory 39(4): 1270-1279 (1993) - [j17]Neri Merhav, Meir Feder:
Universal schemes for sequential decision from individual data sequences. IEEE Trans. Inf. Theory 39(4): 1280-1292 (1993) - [j16]Neri Merhav:
On the minimum description length principle for sources with piecewise constant parameters. IEEE Trans. Inf. Theory 39(6): 1962-1967 (1993) - [j15]Neri Merhav, Chin-Hui Lee:
On the asymptotic statistical behavior of empirical cepstral coefficients. IEEE Trans. Signal Process. 41(5): 1990-1993 (1993) - 1992
- [j14]Jacob Ziv, Neri Merhav:
Estimating the number of states of a finite-state source. IEEE Trans. Inf. Theory 38(1): 61-65 (1992) - [j13]Neri Merhav, David L. Neuhoff:
Variable-to-fixed length codes provide better large deviations performance than fixed-to-variable length codes. IEEE Trans. Inf. Theory 38(1): 135-140 (1992) - [j12]Meir Feder, Neri Merhav, Michael Gutman:
Universal prediction of individual sequences. IEEE Trans. Inf. Theory 38(4): 1258-1270 (1992) - [j11]Ofer Zeitouni, Jacob Ziv, Neri Merhav:
When is the generalized likelihood ratio test optimal? IEEE Trans. Inf. Theory 38(5): 1597-1602 (1992) - [j10]Yariv Ephraim, Neri Merhav:
Lower and upper bounds on the minimum mean-square error in composite source signal estimation. IEEE Trans. Inf. Theory 38(6): 1709-1724 (1992) - [c3]Neri Merhav, Meir Feder:
Universal Sequential Learning and Decision from Individual Data Sequences. COLT 1992: 413-427 - 1991
- [j9]Neri Merhav:
Universal coding with minimum probability of codeword length overflow. IEEE Trans. Inf. Theory 37(3): 556-563 (1991) - [j8]Neri Merhav, Jacob Ziv:
A Bayesian approach for classification of Markov sources. IEEE Trans. Inf. Theory 37(4): 1067-1071 (1991) - [j7]Neri Merhav:
Universal classification for hidden Markov models. IEEE Trans. Inf. Theory 37(6): 1586-1594 (1991) - [j6]Neri Merhav, Yariv Ephraim:
Maximum likelihood hidden Markov modeling using a dominant sequence of states. IEEE Trans. Signal Process. 39(9): 2111-2115 (1991) - [j5]Neri Merhav, Yariv Ephraim:
A Bayesian classification approach with application to speech recognition. IEEE Trans. Signal Process. 39(10): 2157-2166 (1991) - [c2]Neri Merhav, Yariv Ephraim:
Hidden Markov modeling using the most likely state sequence. ICASSP 1991: 469-472 - [c1]Neri Merhav, Yariv Ephraim:
A Bayesian classification approach with application to speech recognition. ICASSP 1991: 529-532 - 1990
- [j4]Neri Merhav, Jacob Ziv:
On universally efficient estimation of the first order autoregressive parameter and universal data compression. IEEE Trans. Inf. Theory 36(6): 1245-1254 (1990)
1980 – 1989
- 1989
- [j3]Neri Merhav, Jacob Ziv:
Estimating with partial statistics the parameters of ergodic finite Markov sources. IEEE Trans. Inf. Theory 35(2): 326-333 (1989) - [j2]Neri Merhav, Michael Gutman, Jacob Ziv:
On the estimation of the order of a Markov chain and universal data compression. IEEE Trans. Inf. Theory 35(5): 1014-1019 (1989) - [j1]Neri Merhav:
The estimation of the model order in exponential families. IEEE Trans. Inf. Theory 35(5): 1109-1114 (1989)
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 2025-02-19 00:48 CET 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:
