Pith. sign in

REVIEW

Implementation and Experimental Evaluation of Reed-Solomon Identification

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

arxiv 2107.06801 v2 pith:RWN2ZFZI submitted 2021-07-14 cs.IT math.IT

Implementation and Experimental Evaluation of Reed-Solomon Identification

classification cs.IT math.IT
keywords identificationcodestransmissioncommunicationevaluationexponentiallypracticalrates
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Identification is a communication paradigm that promises exponential advantages over transmission for applications that do not actually require all messages to be reliably transmitted. Notably, the identification capacity theorems prove exponentially larger rates compared to classical transmission. However, there exist additional trade-offs that are not captured by these theorems and which become relevant for the deployment of identification in practical communication settings. In particular, in this paper we evaluate the latency introduced by computations at the encoder and decoder when employing identification codes. For this, we implement them using an explicit code construction based on Reed-Solomon codes and integrate it into a single carrier transmission system using software-defined radios. Our evaluation of the practical aspects of identification codes show that unless care is taken, these trade-offs can compromise the theoretical advantage given by the exponentially large identification rates.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.