Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ye, Zuo, Ge, Gennian
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Bounds and Constructions of $\ell$-Read Codes under the Hamming Metric
by: Sun, Yubo, et al.
Published: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

DoDo-Code: an Efficient Levenshtein Distance Embedding-based Code for 4-ary IDS Channel
by: Guo, Alan J. X., et al.
Published: (2023)

Generalized Arlery-Tan-Rabaste-Levenshtein Lower Bounds on Ambiguity Function and Their Asymptotic Achievability
by: Meng, Lingsheng, et al.
Published: (2024)

Levenshtein's Sequence Reconstruction Problem and Results for Larger Alphabet Sizes
by: Junnila, Ville, et al.
Published: (2025)

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

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

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

On the size distribution of Levenshtein balls with radius one
by: Wang, Geyang, et al.
Published: (2022)

Private Information Retrieval over Graphs
by: Ge, Gennian, et al.
Published: (2025)

Optimal redundancy of function-correcting codes
by: Ge, Gennian, et al.
Published: (2025)

On the Asymptotic Rate of Optimal Codes that Correct Tandem Duplications for Nanopore Sequencing
by: Yu, Wenjun, et al.
Published: (2024)

Bounds on Sphere Sizes in the Sum-Rank Metric and Coordinate-Additive Metrics
by: Couvée, Hugo Beeloo-Sauerbier, et al.
Published: (2024)

Maximum Entropy and Bayesian Conditioning Under Extended Space
by: Yu, Boning
Published: (2025)

On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model
by: Junnila, Ville, et al.
Published: (2024)

MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes
by: Li, Guodong, et al.
Published: (2023)

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

On Function-Correcting Codes in the Lee Metric
by: Verma, Gyanendra K., et al.
Published: (2025)

On the Maximum Number of Codewords of X-Codes of Constant Weight Three
by: Tsunoda, Yu, et al.
Published: (2019)

$r$-Minimal Codes with Respect to Rank Metric
by: Xu, Yang, et al.
Published: (2024)

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

Policy-Guided MCTS for near Maximum-Likelihood Decoding of Short Codes
by: Tian, Y., et al.
Published: (2025)

Maximum Sum-Rank Distance Codes over Finite Chain Rings
by: Martínez-Peñas, Umberto, et al.
Published: (2021)

Multi-answer Constrained Optimal Querying: Maximum Information Gain Coding
by: Li, Zhefan, et al.
Published: (2024)