Copertina

Bounds and Constructions of $\ell$-Read Codes under the Hamming Metric

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Sun, Yubo, Ge, Gennian
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Information Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction
di: Sun, Yubo, et al.
Pubblicazione: (2025)

Criss-Cross Deletion Correcting Codes: Optimal Constructions with Efficient Decoders
di: Sun, Yubo, et al.
Pubblicazione: (2025)

Binary Codes for Correcting Two Edits
di: Sun, Yubo, et al.
Pubblicazione: (2024)

On the Palindromic/Reverse-Complement Duplication Correcting Codes
di: Sun, Yubo, et al.
Pubblicazione: (2026)

Correcting One Deletion and One Substitution with a Constant Number of Reads
di: Li, Yuling, et al.
Pubblicazione: (2026)

Binary Reconstruction Codes for Correcting One Deletion and One Substitution
di: Li, Yuling, et al.
Pubblicazione: (2025)

Correcting Bursty/Localized Deletions: A New Error-Position-Estimation Code
di: Ye, Zuo, et al.
Pubblicazione: (2025)

Correcting Errors Through Partitioning and Burst-Deletion Correction
di: Sun, Yubo, et al.
Pubblicazione: (2025)

Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels
di: Yu, Wenjun, et al.
Pubblicazione: (2025)

On the Maximum Size of Codes Under the Damerau-Levenshtein Metric
di: Ye, Zuo, et al.
Pubblicazione: (2025)

Bounds and Constructions of Codes for Ordered Composite DNA Sequences
di: Ye, Zuo, et al.
Pubblicazione: (2026)

Asymptotically Optimal Codes for $(t,s)$-Burst Error
di: Sun, Yubo, et al.
Pubblicazione: (2024)

Weighted-Hamming Metric: Bounds and Codes
di: Bitzer, Sebastian, et al.
Pubblicazione: (2026)

Sequence Reconstruction under Channels with Multiple Bursts of Insertions or Deletions
di: Lan, Zhaojun, et al.
Pubblicazione: (2025)

On the Fixed-Length-Burst Levenshtein Ball with Unit Radius
di: Xi, Yuanxiao, et al.
Pubblicazione: (2025)

Codes Correcting Two Bursts of Exactly $b$ Deletions
di: Ye, Zuo, et al.
Pubblicazione: (2024)

Linear Network Coding for Robust Function Computation and Its Applications in Distributed Computing
di: Wei, Hengjia, et al.
Pubblicazione: (2024)

Griesmer Bound and Constructions of Linear Codes in $b$-Symbol Metric
di: Luo, Gaojun, et al.
Pubblicazione: (2024)

New results on sparse representations in unions of orthonormal bases
di: Zhang, Tao, et al.
Pubblicazione: (2024)

Weighted-Hamming Metric for Parallel Channels
di: Bitzer, Sebastian, et al.
Pubblicazione: (2024)

On the Existence and Nonexistence of Splitter Sets
di: Yuan, Zhiyu, et al.
Pubblicazione: (2025)

Network function computation with vector linear target function and security function
di: Xu, Min, et al.
Pubblicazione: (2026)

Locally Repairable Convertible Codes: Improved Lower Bound and General Construction
di: Ge, Songping, et al.
Pubblicazione: (2025)

Plotkin-like Bound and Explicit Function-Correcting Code Constructions for Lee Metric Channels
di: K., Hareesh, et al.
Pubblicazione: (2025)

The Arithmetic Singleton Bound on the Hamming Distances of Simple-rooted Constacyclic Codes over Finite Fields
di: Zhu, Li, et al.
Pubblicazione: (2026)

An Elementary Approach to MacWilliams Extension Property and Constant Weight Code with Respect to Weighted Hamming Metric
di: Xu, Yang, et al.
Pubblicazione: (2025)

On the Hamming Weight Functions of Linear Codes
di: Huang, Dongmei, et al.
Pubblicazione: (2025)

On hierarchical secure aggregation against relay and user collusion
di: Xu, Min, et al.
Pubblicazione: (2025)

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

Function-Correcting Codes with Optimal Data Protection for Hamming Code Membership
di: Durgi, Swaraj Sharma, et al.
Pubblicazione: (2026)

Multiset Deletion-Correcting Codes: Bounds and Constructions
di: Kreindel, Avraham, et al.
Pubblicazione: (2026)

Constrained coding upper bounds via Goulden-Jackson cluster theorem
di: Shen, Yuanting, et al.
Pubblicazione: (2024)

The Sequence Reconstruction of Permutations under Hamming Metric with Small Errors
di: Abdollahi, A., et al.
Pubblicazione: (2026)

Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
di: Berman, Amit, et al.
Pubblicazione: (2026)

Bounds and Constructions of High-Memory Spatially-Coupled Codes
di: Huang, Lei
Pubblicazione: (2025)

Bounds and Optimal Constructions of Generalized Merge-Convertible Codes for Code Conversion into LRCs
di: Shi, Haoming, et al.
Pubblicazione: (2025)

Construction and Fast Decoding of Binary Linear Sum-Rank-Metric Codes
di: Chen, Hao, et al.
Pubblicazione: (2023)

Function-Correction with Optimal Data Protection for the General Hamming Code Membership
di: Yadava, Adityawardhan, et al.
Pubblicazione: (2026)

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

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