Lund University Publications
metadata only
On the construction of universal families of hash functions via geometric codes and concatenation
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Universal hash functions from exponential sums over finite fields and Galois rings#620332
- Universal Hashing and Geometric Codes#921554
- Systematic Codes Correcting Two Deletions with Three Redundant Symbols over Large Alphabets#1142860
- Logical Operator Decomposition for Distance Analysis of Bivariate Bicycle Codes#1144362
- Space-Efficient Lock-Free Linear-Probing Hash Table#282770
Record · ID 612900
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive