On the size distribution of the fixed-length Levenshtein balls with radius one

DOI10.1007/S10623-024-01382-1MaRDI QIDQ6587203FDOQ6587203

Authors: Geyang Wang, Qi Wang 

Publication date: 13 August 2024

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Recommendations

• Covering codes for the fixed length Levenshtein metric
• Volume formula and growth rates of the balls of strings under the edit distances
• On the Levenshtein automaton and the size of the neighbourhood of a word
• Levenshtein graphs: resolvability, automorphisms \& determining sets
• Computing the ball size of frequency permutations under Chebyshev distance

zbMATH Keywords

Azuma's inequalityfixed-length Levenshtein distanceLevenshtein ball

Mathematics Subject Classification ID

Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Synchronization error-correcting codes (94B50)

Cites Work

• Title not available (Why is that?)
• The probabilistic method
• A survey of results for deletion channels and related synchronization channels
• Some general results of coding theory with applications to the study of codes for the correction of synchronization errors
• On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric

Cited In (2)

• Covering codes for the fixed length Levenshtein metric
• Volume formula and growth rates of the balls of strings under the edit distances

This page was built for publication: On the size distribution of the fixed-length Levenshtein balls with radius one

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587203)