For computer engineers, data such as text documents, music files and video files are just series of bits, being either zero or one. Such sequences can be mixed, merged and compressed into bit sequences of fixed length, and we say that the bit sequence is hashed. Hashing algorithms map files of different lengths onto bit sequences of the same length, and they can help to identify original files. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Schindelhauer, C. (2011). Hashing. In Algorithms Unplugged (pp. 195–201). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_20
Mendeley helps you to discover research relevant for your work.