Bloom filter with noisy coding framework for multi-set membership testing
This article is on designing a compact data structure for multi-set membership testing that
allows fast set querying. Multi-set membership testing is a fundamental operation for …
allows fast set querying. Multi-set membership testing is a fundamental operation for …
Fuzzy extractors: How to generate strong keys from biometrics and other noisy data
We provide formal definitions and efficient secure techniques for turning biometric
information into keys usable for any cryptographic application, and reliably and securely …
information into keys usable for any cryptographic application, and reliably and securely …
Fuzzy extractors: How to generate strong keys from biometrics and other noisy data
We provide formal definitions and efficient secure techniques for turning noisy information
into keys usable for any cryptographic application, and, in particular, reliably and securely …
into keys usable for any cryptographic application, and, in particular, reliably and securely …
[图书][B] Classification algorithms for codes and designs
P Kaski, PRJ Östergård - 2006 - Springer
Classification Algorithms for Codes and Designs Page 1 Algorithms and Computation in
Mathematics Volume 15 Classification Algorithms for Codes and Designs Classification …
Mathematics Volume 15 Classification Algorithms for Codes and Designs Classification …
[图书][B] List decoding of error-correcting codes: winning thesis of the 2002 ACM doctoral dissertation competition
V Guruswami - 2004 - books.google.com
How can one exchange information e? ectively when the medium of com-nication introduces
errors? This question has been investigated extensively starting with the seminal works of …
errors? This question has been investigated extensively starting with the seminal works of …
The number of olfactory stimuli that humans can discriminate is still unknown
RC Gerkin, JB Castro - Elife, 2015 - elifesciences.org
It was recently proposed that humans can discriminate between at least a trillion olfactory
stimuli. Here we show that this claim is the result of a fragile estimation framework capable of …
stimuli. Here we show that this claim is the result of a fragile estimation framework capable of …
New code upper bounds from the Terwilliger algebra and semidefinite programming
A Schrijver - IEEE Transactions on Information Theory, 2005 - ieeexplore.ieee.org
We give a new upper bound on the maximum size A (n, d) of a binary code of word length n
and minimum distance at least d. It is based on block-diagonalizing the Terwilliger algebra …
and minimum distance at least d. It is based on block-diagonalizing the Terwilliger algebra …
Rank-metric codes and their applications
H Bartz, L Holzbaur, H Liu, S Puchinger… - … and Trends® in …, 2022 - nowpublishers.com
The rank metric measures the distance between two matrices by the rank of their difference.
Codes designed for the rank metric have attracted considerable attention in recent years …
Codes designed for the rank metric have attracted considerable attention in recent years …
A new algorithm for the maximum-weight clique problem
PRJ Östergård - Nordic Journal of Computing, 2001 - dl.acm.org
Given a graph, in the maximum clique problem one wants to find the largest number of
vertices, any two of which are adjacent. In the maximum-weight clique problem, the vertices …
vertices, any two of which are adjacent. In the maximum-weight clique problem, the vertices …
[图书][B] Reliable broadcast of safety messages in vehicular ad hoc networks
Broadcast communications is critically important in vehicular networks. Many safety
applications need safety warning messages to be broadcast to all vehicles present in an …
applications need safety warning messages to be broadcast to all vehicles present in an …