scientific article; zbMATH DE number 2162205

zbMATH Open1060.94010MaRDI QIDQ4672912FDOQ4672912

Authors: Gerzson Kéri, Ákos Kisvölcsey 

Publication date: 28 April 2005

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

Hamming distanceminimum distancecovering radiusHamming weightintersecting sets

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)

Cited In (7)

• Title not available (Why is that?)
• Tight Cell-Probe Bounds for Online Hamming Distance Computation
• Secure computation of functionalities based on Hamming distance and its application to computing document similarity
• Title not available (Why is that?)
• On minimal Hamming compatible distances
• A linear-time algorithm for Hamming distance with shifts
• Hamming distance for conjugates

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)