REVIEW
Identification based on random coding
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Ahlswede and Dueck showed possibility to identify with high probability one out of $M$ messages by transmitting $1/C\log\log M$ bits only, where $C$ is the channel capacity. It is known that this identification can be based on error-correcting codes. We propose an identification procedure based on random codes that achieves channel capacity. Then we show that this procedure can be simplified using pseudo-random generators.
Discussion (0). Sign in to comment.