Optimal Hash Functions for Approximate Matches on the $n$-Cube

DOI10.1109/TIT.2009.2039037zbMath1368.68210OpenAlexW2166015129MaRDI QIDQ5281561

Victor S. Miller, Daniel M. Gordon, Peter Ostapenko

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2009.2039037

Mathematics Subject Classification ID

Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (4)

Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions ⋮ Identifying an unknown code by partial Gaussian elimination ⋮ Memoryless near-collisions via coding theory ⋮ Optimal Covering Codes for Finding Near-Collisions

This page was built for publication: Optimal Hash Functions for Approximate Matches on the $n$-Cube