Covering codes for the fixed length Levenshtein metric
From MaRDI portal
Publication:6148190
DOI10.1134/s0032946023020023OpenAlexW4390148053MaRDI QIDQ6148190
Publication date: 11 January 2024
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946023020023
Cites Work
- Unnamed Item
- Unnamed Item
- Asymmetric binary covering codes.
- Generalized Sphere Packing Bound
- Covering codes with improved density
- Locality-sensitive Hashing without False Negatives
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
- On asymmetric coverings and covering numbers
- Football Pools--A Game for Mathematicians
- Covering Codes Using Insertions or Deletions
- Probability Inequalities for Sums of Bounded Random Variables
- Efficient reconstruction of sequences from their subsequences of supersequences
This page was built for publication: Covering codes for the fixed length Levenshtein metric
