:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Nageswaran, Ajaykrishnan, Narayan, Prakash
Formato:	Preprint
Publicado:	2023
Materias:	Information Theory
Acceso en línea:	https://arxiv.org/abs/2307.05828
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

List Recoverable Codes: The Good, the Bad, and the Unknown (hopefully not Ugly)
por: Resch, Nicolas, et al.
Publicado: (2025)

Random Reed-Solomon Codes are List Recoverable with Optimal List Size
por: Doron, Dean, et al.
Publicado: (2024)

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes
por: Komech, Sergey, et al.
Publicado: (2025)

Shared Information for a Markov Chain on a Tree
por: Bhattacharya, Sagnik, et al.
Publicado: (2023)

Quantum Locally Recoverable Codes via Good Polynomials
por: Sharma, Sandeep, et al.
Publicado: (2024)

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

Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes
por: Brakensiek, Joshua, et al.
Publicado: (2025)

Secure Storage using Maximally Recoverable Locally Repairable Codes
por: Janz, Tim, et al.
Publicado: (2024)

$q$-ary Sequential Locally Recoverable Codes from the Product Construction
por: Baghban, Akram, et al.
Publicado: (2024)

A Construction of Optimal Quasi-cyclic Locally Recoverable Codes using Constituent Codes
por: Bastos, Gustavo Terra, et al.
Publicado: (2024)

Design of MDP Convolutional Codes and Maximally Recoverable Codes Through the Lens of Matrix Completion
por: Dang, Sakshi, et al.
Publicado: (2026)

Adaptive Privacy of Sequential Data Releases Under Collusion
por: Taylor, Sophie, et al.
Publicado: (2026)

Majority-Logic Decoding of Binary Locally Recoverable Codes: A Probabilistic Analysis
por: Ly, Hoang, et al.
Publicado: (2026)

Information Capacity of EEG: Theoretical and Computational Limits of Recoverable Neural Information
por: Rao, Ishir
Publicado: (2025)

Balancing Privacy and Robustness in Coded Computing Under Profiled Workers
por: Borah, Rimpi, et al.
Publicado: (2026)

Recoverable systems and the maximal hard-core model on the triangular lattice
por: Wang, Geyang, et al.
Publicado: (2026)

Beyond Polynomials: Optimal Locally Recoverable Codes from Good Rational Functions
por: Liu, Hengfeng, et al.
Publicado: (2026)

List Estimation
por: Zlatanov, Nikola, et al.
Publicado: (2026)

Privacy-Utility Trade-offs Under Multi-Level Point-Wise Leakage Constraints
por: Zamani, Amirreza, et al.
Publicado: (2026)

Beyond Exact Fairness: Envy-Free Incomplete Connected Fair Division
por: S, Ajaykrishnan E, et al.
Publicado: (2025)

New Construction of Locally q-ary Sequential Recoverable Codes: Parity-check Matrix Approach
por: Baghban, Akram, et al.
Publicado: (2025)

Strict Optimality of Frequency and Distribution Estimation Under Local Differential Privacy
por: Pan, Mingen
Publicado: (2026)

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

Hierarchical Locally Recoverable Codes on surfaces
por: Araujo, Carolina, et al.
Publicado: (2026)

Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size
por: Ron-Zewi, Noga, et al.
Publicado: (2024)

List decoding of repeated codes
por: Hernando, Fernando, et al.
Publicado: (2012)

List decoding of evaluation codes
por: Brazitikos, Silouanos, et al.
Publicado: (2025)

Recovering a Message from an Incomplete Set of Noisy Fragments
por: Ravi, Aditya Narayan, et al.
Publicado: (2024)

Extended Functional Representation Lemma: A Tool For Privacy, Semantic Representation, Caching, and Compression Design
por: Zamani, Amirreza, et al.
Publicado: (2024)

Error Exponents for Randomised List Decoding
por: Miyamoto, Henrique K., et al.
Publicado: (2026)

A categorical characterization of relative entropy on standard Borel spaces
por: Gagne, Nicolas, et al.
Publicado: (2017)

Stabilization of Perturbed Loss Function: Differential Privacy without Gradient Noise
por: Habib, Salman, et al.
Publicado: (2025)

Optimal Privacy-Utility Trade-Offs in LDP: Functional and Geometric Perspectives
por: Nam, Seung-Hyun, et al.
Publicado: (2026)

Sample Complexity Bounds for Scalar Parameter Estimation Under Quantum Differential Privacy
por: Farokhi, Farhad
Publicado: (2025)

Decoding Insertions/Deletions via List Recovery
por: Banerjee, Anisha, et al.
Publicado: (2025)

Soft-Output Successive Cancellation List Decoding
por: Yuan, Peihong, et al.
Publicado: (2024)

List-Decodable Folded Quantum Hermitian Codes
por: Matthews, Gretchen L., et al.
Publicado: (2026)

Simplified Successive Cancellation List Decoding of PAC Codes
por: Saber, Hamid, et al.
Publicado: (2024)

PAC Codes: Sequential Decoding vs List Decoding
por: Rowshan, Mohammad, et al.
Publicado: (2020)

Reverse PAC Codes: Look-ahead List Decoding
por: Gu, Xinyi, et al.
Publicado: (2024)