Search Results for author:
Found 2 papers, 2 papers with code
Committed Private Information Retrieval
A PIR scheme is $v$-verifiable if the client can verify the correctness of the retrieved $x_i$ even when $v \leq k$ servers collude and try to fool the client by sending manipulated data.
Optimal Codes Correcting a Single Indel / Edit for DNA-Based Data Storage
In this paper, we investigate codes that combat either a single indel or a single edit and provide linear-time algorithms that encode binary messages into these codes of length n. Over the quaternary alphabet, we provide two linear-time encoders.
Information Theory Information Theory
Cannot find the paper you are looking for? You can
Submit a new open access paper.
