:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Wang, Hsin-Po, Guruswami, Venkatesan
Formato:	Preprint
Publicado:	2024
Materias:	Information Theory
Acceso en línea:	https://arxiv.org/abs/2405.16374
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding
por: Guruswami, Venkatesan, et al.
Publicado: (2023)

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

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

Geno-Weaving: Low-Complexity Capacity-Achieving DNA Storage
por: Wang, Hsin-Po, et al.
Publicado: (2024)

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

Capacity-Achieving Gray Codes
por: Guruswami, Venkatesan, et al.
Publicado: (2024)

Block Length Gain for Nanopore Channels
por: Lin, Yu-Ting, et al.
Publicado: (2025)

Maximal Recoverability: A Nexus of Coding Theory
por: Brakensiek, Joshua, et al.
Publicado: (2026)

Decoding Quasi-Cyclic Quantum LDPC Codes
por: Golowich, Louis, et al.
Publicado: (2024)

Quantum LDPC Codes of Almost Linear Distance via Homological Products
por: Golowich, Louis, et al.
Publicado: (2024)

Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates
por: Golowich, Louis, et al.
Publicado: (2024)

Structure Theorems (and Fast Algorithms) for List Recovery of Subspace-Design Codes
por: Goyal, Rohan, et al.
Publicado: (2025)

Near-Asymptotically-Good Quantum Codes with Transversal CCZ Gates and Sublinear-Weight Parity-Checks
por: Golowich, Louis, et al.
Publicado: (2025)

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
por: Alrabiah, Omar, et al.
Publicado: (2024)

Punctured Low-Bias Codes Behave Like Random Linear Codes
por: Guruswami, Venkatesan, et al.
Publicado: (2021)

A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble
por: Guruswami, Venkatesan, et al.
Publicado: (2023)

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

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

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
por: Alrabiah, Omar, et al.
Publicado: (2023)

Explicit Constant-Alphabet Subspace Design Codes
por: Goyal, Rohan, et al.
Publicado: (2026)

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

Communication with Imperfectly Shared Randomness
por: Canonne, Clément L., et al.
Publicado: (2014)

Threshold rates for properties of random codes
por: Guruswami, Venkatesan, et al.
Publicado: (2020)

Bounds for list-decoding and list-recovery of random linear codes
por: Guruswami, Venkatesan, et al.
Publicado: (2020)

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

Explicit optimal-length locally repairable codes of distance 5
por: Beemer, Allison, et al.
Publicado: (2018)

On Counting Subsequences and Higher-Order Fibonacci Numbers
por: Wang, Hsin-Po, et al.
Publicado: (2024)

MichelangeRoll: Sculpting Rational Distributions Exactly and Efficiently
por: Shao, Jui-Hsiang, et al.
Publicado: (2025)

Sidorenko-Inspired Pessimistic Estimation
por: Lin, Yu-Ting, et al.
Publicado: (2026)

Ambidextrous Degree Sequence Bounds for Pessimistic Cardinality Estimation
por: Lin, Yu-Ting, et al.
Publicado: (2025)

Fundamental Limits of Non-Adaptive Group Testing with Markovian Correlation
por: Ravi, Aditya Narayan, et al.
Publicado: (2025)

Optimal Non-Adaptive Group Testing with One-Sided Error Guarantees
por: McMorrow, Daniel, et al.
Publicado: (2025)

Exact Thresholds for Noisy Non-Adaptive Group Testing
por: Chen, Junren, et al.
Publicado: (2024)

Novel Decoding Algorithm for Noiseless Non-Adaptive Group Testing
por: Franco-Vivo, Manuel
Publicado: (2026)

Ensemble Average Analysis of Non-Adaptive Group Testing with Sparse Pooling Graphs
por: Yacoub, Emna Ben, et al.
Publicado: (2025)

Learning to Ask: Decision Transformers for Adaptive Quantitative Group Testing
por: Soleymani, Mahdi, et al.
Publicado: (2025)

Cascaded Group Testing
por: Mirza, Waqar, et al.
Publicado: (2024)

The Sample Complexity of Simple Binary Hypothesis Testing
por: Pensia, Ankit, et al.
Publicado: (2024)

Non-Abelian qLDPC: TQFT Formalism, Addressable Gauging Measurement and Application to Magic State Fountain on 2D Product Codes
por: Zhu, Guanyu, et al.
Publicado: (2026)

Small-Error Cascaded Group Testing
por: McMorrow, Daniel, et al.
Publicado: (2026)