scientific article; zbMATH DE number 1498827

zbMATH Open0951.94024MaRDI QIDQ4501018FDOQ4501018

Authors: V. Yu. Solomennikov, Yu. L. Sagalovich 

Publication date: 3 September 2000

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

Recommendations

• On linear hash codes
• Provably Good Codes for Hash Function Design
• Beating Fredman-Komlós for perfect \(k\)-hashing
• Estimates for distribution of the minimal distance of a random linear code

zbMATH Keywords

hash distancelinear hash codes

Mathematics Subject Classification ID

Bounds on codes (94B65)

Cited In (3)

• Generalized hashing and parent-identifying codes.
• Beating Fredman-Komlós for perfect \(k\)-hashing
• Hash property and coding theorems for sparse matrices and maximum-likelihood coding

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 Q4501018)