scientific article; zbMATH DE number 2162205

MaRDI QIDQ4672912zbMATH OpenFDO

Authors Gerzson Kéri, Ákos Kisvölcsey

Publication date 28 April 2005

zbMATH Keywords

covering radiusHamming distanceHamming weightintersecting setsminimum distance

Mathematics Subject Classification ID

Source coding (94A29) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Communication Complexity of Computing the Hamming Distance
• scientific article; zbMATH DE number 1794217
• A linear-time algorithm for Hamming distance with shifts
• Calcul de la distance par les sous-mots
• Sets of binary sequences with small total Hamming distances

Cited in

(12)

• Hamming distance for conjugates
• A linear-time algorithm for Hamming distance with shifts
• Secure computation of functionalities based on Hamming distance and its application to computing document similarity
• scientific article; zbMATH DE number 1301723 (Why is no real title available?)
• On finding the closest bitwise matches in a fixed set
• scientific article; zbMATH DE number 1794217 (Why is no real title available?)
• scientific article; zbMATH DE number 2123381 (Why is no real title available?)
• Sets with maximum hamming index
• Hashing of databases based on indirect observations of Hamming distances
• Hamming Distance Completeness
• On minimal Hamming compatible distances
• Tight Cell-Probe Bounds for Online Hamming Distance Computation

This page was built for publication:

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