The following pages link to Jonathan Scarlett (Q2976703):
Displaying 41 items.
- Multiuser Random Coding Techniques for Mismatched Decoding (Q2976704) (← links)
- Second-Order Asymptotics for the Gaussian MAC With Degraded Message Sets (Q2977173) (← links)
- A Counter-Example to the Mismatched Decoding Converse for Binary-Input Discrete Memoryless Channels (Q2977219) (← links)
- On the Dispersions of the Gel’fand–Pinsker Channel and Dirty Paper Coding (Q2977259) (← links)
- Second-Order Rate Region of Constant-Composition Codes for the Multiple-Access Channel (Q2978814) (← links)
- The Dispersion of Nearest-Neighbor Decoding for Additive Non-Gaussian Channels (Q2979078) (← links)
- Limits on Support Recovery With Probabilistic Models: An Information-Theoretic Framework (Q2979125) (← links)
- Expurgated Random-Coding Ensembles: Exponents, Refinements, and Connections (Q2986194) (← links)
- Mismatched Decoding: Error Exponents, Second-Order Rates and Saddlepoint Approximations (Q2986378) (← links)
- Mismatched Multi-Letter Successive Decoding for the Multiple-Access Channel (Q4569179) (← links)
- Phase Transitions in Group Testing (Q4575578) (← links)
- Compressed Sensing With Prior Information: Information-Theoretic Limits and Practical Decoders (Q4578368) (← links)
- Performance of Group Testing Algorithms With Near-Constant Tests Per Item (Q4615335) (← links)
- An adaptive sublinear-time block sparse fourier transform (Q4978017) (← links)
- Sublinear-Time Non-Adaptive Group Testing With <i>O</i>(<i>k</i> log <i>n</i>) Tests via Bit-Mixing Coding (Q5003676) (← links)
- Optimal Rates of Teaching and Learning Under Uncertainty (Q5032556) (← links)
- Optimal non-adaptive probabilistic group testing in general sparsity regimes (Q5044117) (← links)
- Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms (Q5088467) (← links)
- Noisy Adaptive Group Testing via Noisy Binary Search (Q5088474) (← links)
- Noisy Non-Adaptive Group Testing: A (Near-)Definite Defectives Approach (Q5124399) (← links)
- Information-Theoretic Foundations of Mismatched Decoding (Q5134911) (← links)
- Support Recovery in the Phase Retrieval Model: Information-Theoretic Fundamental Limit (Q5138939) (← links)
- Group Testing: An Information Theory Perspective (Q5213209) (← links)
- Generalized Random Gilbert-Varshamov Codes (Q5224008) (← links)
- Noisy Adaptive Group Testing: Bounds and Algorithms (Q5224021) (← links)
- Fast splitting algorithms for sparsity-constrained and noisy group testing (Q6039769) (← links)
- (Q6084356) (← links)
- Performance Bounds for Group Testing With Doubly-Regular Designs (Q6193591) (← links)
- Simple Coding Techniques for Many-Hop Relaying (Q6195751) (← links)
- Multi-Bit Relaying Over a Tandem of Channels (Q6198918) (← links)
- Learning Erd\H{o}s-R\'enyi Random Graphs via Edge Detecting Queries (Q6318443) (← links)
- Optimal Non-Adaptive Probabilistic Group Testing in General Sparsity Regimes (Q6341875) (← links)
- Exact Thresholds for Noisy Non-Adaptive Group Testing (Q6516776) (← links)
- Non-adaptive algorithms for threshold group testing with consecutive positives (Q6548430) (← links)
- Mismatched rate-distortion theory: ensembles, bounds, and general alphabets (Q6576075) (← links)
- Maxflow-based bounds for low-rate information propagation over noisy networks (Q6576571) (← links)
- Tight regret bounds for noisy optimization of a Brownian motion (Q6602751) (← links)
- Model-based and graph-based priors for group testing (Q6603296) (← links)
- Approximate message passing with rigorous guarantees for pooled data and quantitative group testing (Q6633050) (← links)
- Concomitant group testing (Q6670183) (← links)
- Optimal 1-bit error exponent for 2-hop relaying with binary-input channels (Q6670207) (← links)
