Performance Analysis of Identification Codes release_jpfks47xpjdfbk47kdnvymi5w4

by Sencer Derebeyoğlu, Christian Deppe, Roberto Ferrara

Published in Entropy by MDPI AG.

2020   Volume 22, Issue 10, p1067

Abstract

In this paper, we analyze the construction of identification codes. Identification codes are based on the question: "Is the message I have just received the one I am interested in?", as opposed to Shannon's transmission, where the receiver is interested in not only one, but any, message. The advantage of identification is that it allows rates growing double exponentially in the blocklength at the cost of not being able to decode every message, which might be beneficial in certain applications. We focus on a special identification code construction based on two concatenated Reed-Solomon codes and have a closer look at its implementation, analyzing the trade-offs of identification with respect to transmission and the trade-offs introduced by the computational cost of identification codes.
In application/xml+jats format

Archived Files and Locations

application/pdf  322.0 kB
file_jqv2ooxsorb2xfo2gkc3gkctgi
res.mdpi.com (publisher)
web.archive.org (webarchive)

Web Captures

https://www.mdpi.com/1099-4300/22/10/1067/htm
2022-04-24 08:35:21 | 55 resources
webcapture_dsebwy64cngejd4lcj6j3ysz6a
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2020-09-23
Language   en ?
DOI  10.3390/e22101067
PubMed  33286836
Container Metadata
Open Access Publication
In DOAJ
In ISSN ROAD
In Keepers Registry
ISSN-L:  1099-4300
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 5ca7d49e-f001-45b2-a102-cd80e7b754df
API URL: JSON