Verhoeff Algorithm

Verhoeff Algorithm

Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow

     

бумажная книга



Издательство: Книга по требованию
Дата выхода: июль 2011
ISBN: 978-6-1311-3684-9
Объём: 144 страниц
Масса: 239 г
Размеры(В x Ш x Т), см: 23 x 16 x 1

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The Verhoeff algorithm, a checksum formula for error detection first published in 1969, was developed by Dutch mathematician Jacobus Verhoeff (born 1927). Like the more widely known Luhn algorithm, it works with strings of decimal digits of any length. It does a better job than the Luhn algorithm, though, in that it will detect all transposition errors (switching of two adjacent digits), as well as catching many other types of errors that pass the Luhn formula undetected. Verhoeff devised his algorithm using the properties of D5 (the dihedral group of order 10) — a non-commutative system of operations on ten elements, corresponding to the results of rotating or reflecting (flipping) a regular pentagon. In practice, however, the scheme would normally be implemented using precomputed lookup tables.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.

Каталог