Imagen de Portada

On Nearly Perfect Covering Codes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Boruchovsky, Avital, Etzion, Tuvi, Roth, Ron M.
Formato:	Preprint
Publicado:	2024
Materias:	Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On de Bruijn Arrays Codes, Part I: Nonlinear Codes
por: Etzion, Tuvi
Publicado: (2024)

Pseduo-Random and de Bruijn Array Codes
por: Etzion, Tuvi
Publicado: (2023)

Binary and Non-Binary Self-Dual Sequences and Maximum Period Single-Track Gray Codes
por: Etzion, Tuvi
Publicado: (2025)

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

Serving Every Symbol: All-Symbol PIR and Batch Codes
por: Boruchovsky, Avital, et al.
Publicado: (2026)

On de Bruijn Array Codes Part II: Linear Codes
por: Blackburn, Simon, et al.
Publicado: (2025)

On de Bruijn Covering Sequences and Arrays
por: Chee, Yeow Meng, et al.
Publicado: (2024)

The Capacity of the Weighted Read Channel
por: Yerushalmi, Omer, et al.
Publicado: (2024)

Recovery Sets of Subspaces from a Simplex Code
por: Chee, Yeow Meng, et al.
Publicado: (2024)

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

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

Making it to First: The Random Access Problem in DNA Storage
por: Boruchovsky, Avital, et al.
Publicado: (2025)

Permutation Recovery Problem against Deletion Errors for DNA Data Storage
por: Singhvi, Shubhransh, et al.
Publicado: (2024)

Multiple-Error-Correcting Codes for Analog Computing on Resistive Crossbars
por: Wei, Hengjia, et al.
Publicado: (2024)

Repairing with Zero Skip Cost
por: Zhang, Wenqin, et al.
Publicado: (2024)

Closed Expressions for the Weight Distributions of Codes Associated with Perfect Codes
por: Etzion, Tuvi, et al.
Publicado: (2026)

Maximum Length RLL Sequences in de Bruijn Graph
por: Chee, Yeow Meng, et al.
Publicado: (2024)

On the Height Profile of Analog Error-Correcting Codes
por: Roth, Ron M., et al.
Publicado: (2026)

Mixed Steiner Triples Systems with Shortest Length
por: Etzion, Tuvi
Publicado: (2025)

Steiner Systems over Mixed Alphabet and Related Designs
por: Etzion, Tuvi
Publicado: (2025)

A New Class of Geometric Analog Error Correction Codes for Crossbar Based In-Memory Computing
por: Zhu, Ziyuan, et al.
Publicado: (2026)

Covering Codes as Near-Optimal Quantizers for Distributed Testing Against Independence
por: Khaledian, Fatemeh, et al.
Publicado: (2024)

Quasi-Perfect and Distance-Optimal Codes Sum-Rank Codes
por: Chen, Hao
Publicado: (2024)

Repairing Reed-Solomon Codes with Side Information
por: Dinh, Thi Xinh, et al.
Publicado: (2024)

Cache-Aided Variable-Length Coding with Perfect Privacy
por: Zamani, Amirreza, et al.
Publicado: (2023)

Strong Singleton-Like Bounds, Quasi-Perfect Codes and Distance-Optimal Codes in the Sum-Rank Metric
por: Liu, Chao, et al.
Publicado: (2026)

A Note on the Equivalence Between Zero-knowledge and Quantum CSS Codes
por: Ron-Zewi, Noga, et al.
Publicado: (2026)

New Bounds and Constructions for Variable Packet-Error Coding
por: Kong, Xiangliang, et al.
Publicado: (2025)

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

Advances in List Decoding of Polynomial Codes
por: Kumar, Mrinal, et al.
Publicado: (2026)

Efficient Decoding of Double-circulant and Wozencraft Codes from Square-root Errors
por: Dubin, Oren, et al.
Publicado: (2025)

The Construction of Near-optimal Universal Coding of Integers
por: Yan, Wei, et al.
Publicado: (2025)

Near-Optimal Generalized Decoding of Polar-like Codes
por: Yuan, Peihong, et al.
Publicado: (2024)

Non-Binary Covering Codes for Low-Access Computations
por: Ramkumar, Vinayak, et al.
Publicado: (2024)

Dual and Covering Radii of Extended Algebraic Geometry Codes
por: Zhu, Yunlong, et al.
Publicado: (2025)

Perfect Hermitian rank-metric codes
por: Mushrraf, Usman
Publicado: (2024)

Perfectly Private Over-the-Air Computation
por: Weng, Shudi, et al.
Publicado: (2026)

Near-Codewords Aware Bit Flipping Decoding of QC-MDPC Codes
por: Baldelli, Alessio, et al.
Publicado: (2026)

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

Soft-Output from Covered Space Decoding of Product Codes
por: Janz, Tim, et al.
Publicado: (2025)