Image de couverture de livre

On the Maximum Size of Codes Under the Damerau-Levenshtein Metric

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ye, Zuo, Ge, Gennian
Format:	Preprint
Publié:	2025
Sujets:	Information Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Fixed-Length-Burst Levenshtein Ball with Unit Radius
par: Xi, Yuanxiao, et autres
Publié: (2025)

Correcting Bursty/Localized Deletions: A New Error-Position-Estimation Code
par: Ye, Zuo, et autres
Publié: (2025)

Bounds and Constructions of $\ell$-Read Codes under the Hamming Metric
par: Sun, Yubo, et autres
Publié: (2024)

Bounds and Constructions of Codes for Ordered Composite DNA Sequences
par: Ye, Zuo, et autres
Publié: (2026)

Codes Correcting Two Bursts of Exactly $b$ Deletions
par: Ye, Zuo, et autres
Publié: (2024)

Binary Codes for Correcting Two Edits
par: Sun, Yubo, et autres
Publié: (2024)

On the Palindromic/Reverse-Complement Duplication Correcting Codes
par: Sun, Yubo, et autres
Publié: (2026)

Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction
par: Sun, Yubo, et autres
Publié: (2025)

Criss-Cross Deletion Correcting Codes: Optimal Constructions with Efficient Decoders
par: Sun, Yubo, et autres
Publié: (2025)

Binary Reconstruction Codes for Correcting One Deletion and One Substitution
par: Li, Yuling, et autres
Publié: (2025)

Linear Network Coding for Robust Function Computation and Its Applications in Distributed Computing
par: Wei, Hengjia, et autres
Publié: (2024)

Asymptotically Optimal Codes for $(t,s)$-Burst Error
par: Sun, Yubo, et autres
Publié: (2024)

Correcting Errors Through Partitioning and Burst-Deletion Correction
par: Sun, Yubo, et autres
Publié: (2025)

New results on sparse representations in unions of orthonormal bases
par: Zhang, Tao, et autres
Publié: (2024)

On the Existence and Nonexistence of Splitter Sets
par: Yuan, Zhiyu, et autres
Publié: (2025)

Network function computation with vector linear target function and security function
par: Xu, Min, et autres
Publié: (2026)

Correcting One Deletion and One Substitution with a Constant Number of Reads
par: Li, Yuling, et autres
Publié: (2026)

Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels
par: Yu, Wenjun, et autres
Publié: (2025)

DoDo-Code: an Efficient Levenshtein Distance Embedding-based Code for 4-ary IDS Channel
par: Guo, Alan J. X., et autres
Publié: (2023)

Generalized Arlery-Tan-Rabaste-Levenshtein Lower Bounds on Ambiguity Function and Their Asymptotic Achievability
par: Meng, Lingsheng, et autres
Publié: (2024)

Levenshtein's Sequence Reconstruction Problem and Results for Larger Alphabet Sizes
par: Junnila, Ville, et autres
Publié: (2025)

On hierarchical secure aggregation against relay and user collusion
par: Xu, Min, et autres
Publié: (2025)

Sequence Reconstruction under Channels with Multiple Bursts of Insertions or Deletions
par: Lan, Zhaojun, et autres
Publié: (2025)

Constrained coding upper bounds via Goulden-Jackson cluster theorem
par: Shen, Yuanting, et autres
Publié: (2024)

On the size distribution of Levenshtein balls with radius one
par: Wang, Geyang, et autres
Publié: (2022)

Private Information Retrieval over Graphs
par: Ge, Gennian, et autres
Publié: (2025)

Optimal redundancy of function-correcting codes
par: Ge, Gennian, et autres
Publié: (2025)

On the Asymptotic Rate of Optimal Codes that Correct Tandem Duplications for Nanopore Sequencing
par: Yu, Wenjun, et autres
Publié: (2024)

Bounds on Sphere Sizes in the Sum-Rank Metric and Coordinate-Additive Metrics
par: Couvée, Hugo Beeloo-Sauerbier, et autres
Publié: (2024)

Maximum Entropy and Bayesian Conditioning Under Extended Space
par: Yu, Boning
Publié: (2025)

On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model
par: Junnila, Ville, et autres
Publié: (2024)

MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes
par: Li, Guodong, et autres
Publié: (2023)

Weighted-Hamming Metric: Bounds and Codes
par: Bitzer, Sebastian, et autres
Publié: (2026)

On Function-Correcting Codes in the Lee Metric
par: Verma, Gyanendra K., et autres
Publié: (2025)

On the Maximum Number of Codewords of X-Codes of Constant Weight Three
par: Tsunoda, Yu, et autres
Publié: (2019)

$r$-Minimal Codes with Respect to Rank Metric
par: Xu, Yang, et autres
Publié: (2024)

$t$-Balanced Codes with the Kendall-$τ$ Metric
par: Jany, Benjamin, et autres
Publié: (2024)

Policy-Guided MCTS for near Maximum-Likelihood Decoding of Short Codes
par: Tian, Y., et autres
Publié: (2025)

Maximum Sum-Rank Distance Codes over Finite Chain Rings
par: Martínez-Peñas, Umberto, et autres
Publié: (2021)

Multi-answer Constrained Optimal Querying: Maximum Information Gain Coding
par: Li, Zhefan, et autres
Publié: (2024)