The following pages link to Neri Merhav (Q344351):
Displaying 50 items.
- Universal prediction of individual binary sequences in the presence of noise (Q4544661) (← links)
- Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding (Q4544797) (← links)
- On limited-delay lossy coding and filtering of individual sequences (Q4544823) (← links)
- Lower Bounds on Exponential Moments of the Quadratic Error in Parameter Estimation (Q4562131) (← links)
- Channel Detection in Coded Communication (Q4566498) (← links)
- Correction to “The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds” [Aug 17 5039-5051] (Q4566530) (← links)
- On Empirical Cumulant Generating Functions of Code Lengths for Individual Sequences (Q4566601) (← links)
- Converse Bounds on Modulation-Estimation Performance for the Gaussian Multiple-Access Channel (Q4566696) (← links)
- Universal Decoding Using a Noisy Codebook (Q4569177) (← links)
- Statistical Physics for Electrical Engineering (Q4594395) (← links)
- Universal composite hypothesis testing: a competitive minimax approach (Q4674522) (← links)
- Hidden Markov processes (Q4674523) (← links)
- On sequential strategies for loss functions with memory (Q4674553) (← links)
- A competitive Neyman-Pearson approach to universal hypothesis testing with applications (Q4677543) (← links)
- Scanning and prediction in multidimensional data arrays (Q4679881) (← links)
- A large-deviations notion of perfect secrecy (Q4679929) (← links)
- On the error exponent and capacity games of private watermarking systems (Q4679936) (← links)
- Source coding exponents for zero-delay coding with finite memory (Q4679941) (← links)
- Exact Random Coding Exponents and Universal Decoders for the Asymmetric Broadcast Channel (Q4682820) (← links)
- Error Exponents of Typical Random Codes (Q4682909) (← links)
- Joint source-channel coding and guessing with application to sequential decoding (Q4701155) (← links)
- Universal prediction (Q4701188) (← links)
- Hierarchical guessing with a fidelity criterion (Q4701282) (← links)
- Low-complexity sequential lossless coding for piecewise-stationary memoryless sources (Q4701408) (← links)
- The estimation of the model order in exponential families (Q4733235) (← links)
- On the estimation of the order of a Markov chain and universal data compression (Q4733823) (← links)
- A strong version of the redundancy-capacity theorem of universal coding (Q4836898) (← links)
- On information rates for mismatched decoders (Q4850296) (← links)
- A comment on "A rate of convergence result for a universal D-semifaithful code" (Q4857532) (← links)
- (Q4858449) (← links)
- Hierarchical universal coding (Q4896814) (← links)
- Optimal Correlators for Detection and Estimation in Optical Receivers (Q4958221) (← links)
- Joint Source Channel Coding Via Statistical Mechanics: Thermal Equilibrium Between the Source and the Channel (Q4974085) (← links)
- Relations Between Random Coding Exponents and the Statistical Physics of Random Codes (Q4975675) (← links)
- Universal Simulation With Fidelity Criteria (Q4975697) (← links)
- The Generalized Random Energy Model and its Application to the Statistical Physics of Ensembles of Hierarchical Codes (Q4975771) (← links)
- Exact Characterization of the Minimax Loss in Error Exponents of Universal Decoders (Q4975787) (← links)
- On the Statistical Physics of Directed Polymers in a Random Medium and Their Relation to Tree Codes (Q4975984) (← links)
- Statistical Physics of Signal Estimation in Gaussian Noise: Theory and Examples of Phase Transitions (Q4975989) (← links)
- Error Exponents of Optimum Decoding for the Interference Channel (Q4976030) (← links)
- Universal Decoding for Asynchronous Slepian-Wolf Encoding (Q5001570) (← links)
- On More General Distributions of Random Binning for Slepian–Wolf Encoding (Q5030318) (← links)
- Error Exponents in the Bee Identification Problem (Q5032520) (← links)
- On Error Exponents of Encoder-Assisted Communication Systems (Q5032553) (← links)
- The DNA Storage Channel: Capacity and Error Probability Bounds (Q5039973) (← links)
- Finite–State Source–Channel Coding for Individual Source Sequences With Source Side Information at the Decoder (Q5080009) (← links)
- Universal Decoding for the Typical Random Code and for the Expurgated Code (Q5088377) (← links)
- Guessing Based on Compressed Side Information (Q5088549) (← links)
- Error Exponents of Typical Random Trellis Codes (Q5123840) (← links)
- Guessing Individual Sequences: Generating Randomized Guesses Using Finite–State Machines (Q5123904) (← links)
