Двоичные коды с суммированием, имеющие минимальное число необнаруживаемых искажений информационных разрядов

By Вл. В. Сапожников, Дмитрий Викторович Ефанов, А. А. Блюдов. 2012

Subfields: Algorithms & Complexity

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algorithms & Complexity

1. Margaret Mitchell

Citations in the corpus

• Measuring Data (2022, background): “Levenshtein Distance (1965) (language ): is a measurement for calculating the distance between strings, defined as the minimum number of single-character edits (i.e. insertions, deletions) that will convert one word into the other.”