The following pages link to Neri Merhav (Q344351):
Displaying 50 items.
- Universal decoding for source-channel coding with side information (Q344352) (← links)
- Universal prediction of random binary sequences in a noisy environment (Q1431550) (← links)
- On the stochastic complexity of learning realizable and unrealizable rules (Q1900982) (← links)
- On optimum strategies for minimizing the exponential moments of a loss function (Q1953238) (← links)
- Universal detection of messages via finite-state channels (Q2705954) (← links)
- Erasure/List Random Coding Error Exponents Are Not Universally Achievable (Q2976552) (← links)
- Zero-Delay and Causal Secure Source Coding (Q2977133) (← links)
- Universal Quantization for Separate Encodings and Joint Decoding of Correlated Sources (Q2977153) (← links)
- Information–Theoretic Applications of the Logarithmic Probability Comparison Bound (Q2977218) (← links)
- On Compressive Sensing in Coding Problems: A Rigorous Approach (Q2977252) (← links)
- Statistical Physics of Random Binning (Q2978618) (← links)
- Universal Decoding for Gaussian Intersymbol Interference Channels (Q2978664) (← links)
- Optimum Tradeoffs Between the Error Exponent and the Excess-Rate Exponent of Variable-Rate Slepian–Wolf Coding (Q2978716) (← links)
- On Zero-Rate Error Exponents of Finite-State Channels With Input-Dependent States (Q2978763) (← links)
- Exact Random Coding Secrecy Exponents for the Wiretap Channel (Q2979120) (← links)
- Exact Correct-Decoding Exponent of the Wiretap Channel Decoder (Q2979151) (← links)
- List Decoding—Random Coding Exponents and Expurgated Exponents (Q2983317) (← links)
- Asymptotically Optimal Decision Rules for Joint Detection and Source Coding (Q2983319) (← links)
- Zero-Delay and Causal Single-User and Multi-User Lossy Source Coding with Decoder Side Information (Q2983333) (← links)
- Exact Random Coding Error Exponents of Optimal Bin Index Decoding (Q2986086) (← links)
- On the Data Processing Theorem in the Semi–deterministic Setting (Q2986087) (← links)
- Codeword or Noise? Exact Random Coding Exponents for Joint Detection and Decoding (Q2986131) (← links)
- Expurgated Random-Coding Ensembles: Exponents, Refinements, and Connections (Q2986194) (← links)
- Erasure/List Exponents for Slepian–Wolf Decoding (Q2986195) (← links)
- Analysis of Mismatched Estimation Errors Using Gradients of Partition Functions (Q2986441) (← links)
- Perfectly Secure Encryption of Individual Sequences (Q2989344) (← links)
- Random Coding Error Exponents for the Two-User Interference Channel (Q2989638) (← links)
- Structure Theorems for Real-Time Variable Rate Coding With and Without Side Information (Q2989672) (← links)
- On Optimum Parameter Modulation–Estimation From a Large Deviations Perspective (Q2989677) (← links)
- Data-Processing Inequalities Based on a Certain Structured Class of Information Measures With Application to Estimation Theory (Q2989835) (← links)
- Statistical Physics and Information Theory (Q3069051) (← links)
- Sequence complexity and work extraction (Q3302315) (← links)
- Analogy between gambling and measurement-based work extraction (Q3302625) (← links)
- Relations between work and entropy production for general information-driven, finite-state engines (Q3302952) (← links)
- Universal coding with minimum probability of codeword length overflow (Q3358638) (← links)
- A Bayesian approach for classification of Markov sources (Q3361698) (← links)
- One universally efficient estimation of the first-order autoregressive parameter and universal data compression (Q3492698) (← links)
- Lower Bounds on the Error Probability of Block Codes Based on Improvements on de Caen's Inequality (Q3546727) (← links)
- On the Threshold Effect in the Estimation of Chaotic Sequences (Q3547000) (← links)
- On the Error Exponent of Trellis Source Coding (Q3547001) (← links)
- On Joint Information Embedding and Lossy Compression (Q3547356) (← links)
- On Joint Information Embedding and Lossy Compression in the Presence of a Stationary Memoryless Attack Channel (Q3547358) (← links)
- Two-way successively refined joint source-channel coding (Q3547360) (← links)
- Achievable Key Rates for Universal Simulation of Random Data With Respect to a Set of Statistical Tests (Q3547372) (← links)
- On joint coding for watermarking and encryption (Q3547373) (← links)
- On the shannon cipher system with a capacity-limited key-distribution channel (Q3547374) (← links)
- On causal and semicausal codes for joint information embedding and source coding (Q3547382) (← links)
- On joint source-channel coding for the Wyner-Ziv source and the gel'fand~pinsker channel (Q3547385) (← links)
- On Universal Simulation of Information Sources Using Training Data (Q3547387) (← links)
- Addendum to “On Universal Simulation of Information Sources Using Training Data” (Q3547388) (← links)
