Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Reference8 articles.
1. Alon N., Spencer J.H.: The Probabilistic Method. Wiley Series in Discrete Mathematics and Optimization, 4th edn. Wiley, Hoboken (2016).
2. Bar-Lev D., Etzion T., Yaakobi E.: On the size of balls and anticodes of small diameter under the fixed-length Levenshtein metric. IEEE Trans. Inf. Theory 69(4), 2324–2340 (2023).
3. Calabi L., Hartnett W.E.: Some general results of coding theory with applications to the study of codes for the correction of synchronization errors. Inf. Control 15, 235–249 (1969).
4. He L., Ye M.: The size of Levenshtein ball with radius 2: expectation and concentration bound. In: 2023 IEEE International Symposium on Information Theory (ISIT), pp. 850–855. IEEE (2023).
5. Hirschberg D.S., Regnier M.: Tight bounds on the number of string subsequences. J. Discret. Algorithms (Oxf.) 1(1), 123–132 (2000).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Survey for a Decade of Coding for DNA Storage;IEEE Transactions on Molecular, Biological, and Multi-Scale Communications;2024-06