Cover Image

Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Guruswami, Venkatesan, Wang, Hsin-Po
Format:	Preprint
Published:	2023
Subjects:	Information Theory Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Capacity-Achieving Gray Codes
by: Guruswami, Venkatesan, et al.
Published: (2024)

Noisy Nonadaptive Group Testing with Binary Splitting: New Test Design and Improvement on Price-Scarlett-Tan's Scheme
by: Li, Xiaxin, et al.
Published: (2024)

Quickly-Decodable Group Testing with Fewer Tests: Price-Scarlett and Cheraghchi-Nakos's Nonadaptive Splitting with Explicit Scalars
by: Wang, Hsin-Po, et al.
Published: (2024)

Tight bounds for stream decodable error-correcting codes
by: Gupta, Meghal, et al.
Published: (2024)

Semirandom Planted Clique via 1-norm Isometry Property
by: Guruswami, Venkatesan, et al.
Published: (2025)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
by: Alrabiah, Omar, et al.
Published: (2023)

Redundancy Is All You Need (for CSP Sparsification)
by: Brakensiek, Joshua, et al.
Published: (2024)

Asymptotically Optimal Sequential Testing with Heterogeneous LLMs
by: Li, Guokai, et al.
Published: (2026)

Testing (Conditional) Mutual Information
by: Seyfried, Jan, et al.
Published: (2025)

Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication
by: Ly, Hoang, et al.
Published: (2025)

List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

Isolate and then Identify: Rethinking Adaptive Group Testing
by: Wang, Hsin-Po, et al.
Published: (2024)

Improved Explicit Near-Optimal Codes in the High-Noise Regimes
by: Li, Xin, et al.
Published: (2024)

An Efficient Algorithm for Group Testing with Runlength Constraints
by: Dalai, Marco, et al.
Published: (2024)

Continuous Optimization for Decoding Errors
by: Srivastava, Shashank
Published: (2024)

Exponential Time Approximation for Coloring 3-Colorable Graphs
by: Guruswami, Venkatesan, et al.
Published: (2024)

SpecTr: Fast Speculative Decoding via Optimal Transport
by: Sun, Ziteng, et al.
Published: (2023)

Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
by: Ashvinkumar, Vikrant, et al.
Published: (2025)

List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics
by: Peikert, Chris, et al.
Published: (2025)

Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors
by: Brakensiek, Joshua, et al.
Published: (2025)

Testing with Non-identically Distributed Samples
by: Garg, Shivam, et al.
Published: (2023)

Towards Optimal Grammars for RNA Structures
by: Onokpasa, Evarista, et al.
Published: (2024)

Robust Gray Codes Approaching the Optimal Rate
by: Con, Roni, et al.
Published: (2024)

Perturbation-Resilient Trades for Dynamic Service Balancing
by: Sima, Jin, et al.
Published: (2024)

Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs
by: Alaoui, Ziad Ismaili, et al.
Published: (2026)

Satisfying the Restricted Isometry Property with the Optimal Number of Rows and Slightly Less Randomness
by: Rao, Shravas
Published: (2023)

Fast Order Statistics with Group Inequality Testing
by: Liyanage, Adiesha, et al.
Published: (2025)

Scheduling Problems with Constrained Rejections
by: Davies, Sami, et al.
Published: (2025)

Hardness of Learning Boolean Functions from Label Proportions
by: Guruswami, Venkatesan, et al.
Published: (2024)

Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications
by: Bruno, Roberto, et al.
Published: (2025)

Optimal Rates for Differentially Private Hypothesis Testing with E-values
by: Jacobsen, Ben, et al.
Published: (2026)

How Many Matrices Should I Prepare To Polarize Channels Optimally Fast?
by: Wang, Hsin-Po, et al.
Published: (2024)

A Distribution Testing Approach to Clustering Distributions
by: Kumar, Gunjan, et al.
Published: (2025)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
by: Guo, Zeyu, et al.
Published: (2023)

Improved Decoding of Tanner Codes
by: Zhou, Zhaienhe, et al.
Published: (2025)

PTF Testing Lower Bounds for Non-Gaussian Component Analysis
by: Diakonikolas, Ilias, et al.
Published: (2025)

Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation
by: Wang, Ziao, et al.
Published: (2023)

Tight Bounds for Sparsifying Random CSPs
by: Brakensiek, Joshua, et al.
Published: (2025)

Successive Cancellation Sampling Decoder: An Attempt to Analyze List Decoding Theoretically
by: Wang, Hsin-Po, et al.
Published: (2024)

On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment
by: Wang, Ziao, et al.
Published: (2022)