Imagen de Portada

Coded Information Retrieval for Block-Structured DNA-Based Data Storage

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Bar-Lev, Daniella
Formato:	Preprint
Publicado:	2026
Materias:	Information Theory Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Combinatorial Perspective on Random Access Efficiency for DNA Storage
por: Gruica, Anina, et al.
Publicado: (2024)

DNA-Correcting Codes: End-to-end Correction in DNA Storage Systems
por: Boruchovsky, Avital, et al.
Publicado: (2023)

Deep DNA Storage: Scalable and Robust DNA Storage via Coding Theory and Deep Learning
por: Bar-Lev, Daniella, et al.
Publicado: (2021)

The Geometry of Codes for Random Access in DNA Storage
por: Gruica, Anina, et al.
Publicado: (2024)

The Labeled Coupon Collector Problem
por: Tan, Andrew, et al.
Publicado: (2025)

Representing Information on DNA using Patterns Induced by Enzymatic Labeling
por: Bar-Lev, Daniella, et al.
Publicado: (2024)

The Coverage Depth Problem in DNA Storage Over Small Alphabets
por: Bertuzzo, Matteo, et al.
Publicado: (2025)

Double-Cover-Based Analysis of the Bethe Permanent of Block-Structured Positive Matrices
por: Wu, Binghong, et al.
Publicado: (2026)

A Single-Bit Redundancy Framework for Multi-Dimensional Parametric Constraints
por: Bar-Lev, Daniella, et al.
Publicado: (2025)

Storage codes on coset graphs with asymptotically unit rate
por: Barg, Alexander, et al.
Publicado: (2022)

Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack
por: Verma, Neehar, et al.
Publicado: (2024)

On the Capacity of DNA Labeling
por: Hanania, Dganit, et al.
Publicado: (2023)

An Additive Approximation Scheme for Generating Dyadic Codings for the Outputs of an LLM
por: Bar-Lev, Daniella, et al.
Publicado: (2026)

PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound
por: Hollmann, Henk D. L., et al.
Publicado: (2024)

Outer Strong Blocking Sets
por: Alfarano, Gianira N., et al.
Publicado: (2023)

Block components of generalized quaternion group codes
por: Willenborg, Nadja
Publicado: (2025)

On the Reliability of Information Retrieval From MDS Coded Data in DNA Storage
por: Hanna, Serge Kas
Publicado: (2025)

Bounds on Box Codes
por: Langberg, Michael, et al.
Publicado: (2025)

Schubert Subspace Codes
por: Alfarano, Gianira N., et al.
Publicado: (2024)

Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
por: Guo, Zeyu, et al.
Publicado: (2026)

The DNA Coverage Depth Problem: Duality, Weight Distributions, and Applications
por: Bertuzzo, Matteo, et al.
Publicado: (2026)

Polynomials, Divided Differences, and Codes
por: Venkitesh, S.
Publicado: (2024)

The Eigenvalue Method in Coding Theory
por: Abiad, Aida, et al.
Publicado: (2025)

Conditional Entropies of k-Deletion/Insertion Channels
por: Singhvi, Shubhransh, et al.
Publicado: (2024)

Optimal Almost-Balanced Sequences
por: Bar-Lev, Daniella, et al.
Publicado: (2024)

Intersecting Codes and the Connectivity of $q$-Matroids
por: Conca, Fabrizio, et al.
Publicado: (2026)

$t$-Balanced Codes with the Kendall-$τ$ Metric
por: Jany, Benjamin, et al.
Publicado: (2024)

The Service Rate Region of Hamming Codes
por: Choudhary, Priyanka, et al.
Publicado: (2025)

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

Binary Caps and LCD Codes with Large Dimensions
por: Ishizuka, Keita, et al.
Publicado: (2026)

Codes with restricted overlaps: expandability, constructions, and bounds
por: Stanovnik, Lidija
Publicado: (2024)

A Survey on Codes from Simplicial Complexes
por: Wu, Yansheng, et al.
Publicado: (2024)

Private Information Retrieval over Graphs
por: Ge, Gennian, et al.
Publicado: (2025)

Improved Johnson-type Bounds for Insertion-Deletion Codes
por: Yang, Yulin
Publicado: (2026)

On Multidimensional 2-Weight-Limited Burst-Correcting Codes
por: Berend, Hagai, et al.
Publicado: (2025)

Whitney Numbers of Rank-Metric Lattices and Code Enumeration
por: Cotardo, Giuseppe, et al.
Publicado: (2024)

Near-Optimal List-Recovery of Linear Code Families
por: Li, Ray, et al.
Publicado: (2025)

Polynomial Invariants of q-Matroids and Rank-Metric Codes
por: Gluesing-Luerssen, Heide, et al.
Publicado: (2025)

The Support Designs of Several Families of Lifted Linear Codes
por: Ding, Cunsheng, et al.
Publicado: (2024)

On Duplication-Free Codes for Disjoint or Equal-Length Errors
por: Yu, Wenjun, et al.
Publicado: (2024)