Optimal Hash Functions for Approximate Matches on the n-Cube

DOI10.1109/TIT.2009.2039037zbMATH Open1368.68210OpenAlexW2166015129MaRDI QIDQ5281561FDOQ5281561

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)

Cited In (4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281561)