arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.06372cs.ITmath.IT
收藏

识别码的性能分析

Performance Analysis of Identification Codes

Sencer Derebeyoglu, Christian Deppe, Roberto Ferrara

摘要:

本文分析了识别码的构造。识别码是基于这样一个问题:“我刚刚收到的消息是我感兴趣的消息吗?“,而不是香农的传输,在那里接收器感兴趣的不仅是一个,但任何消息。识别的优点是,它允许速率在块长度上呈指数增长,代价是不能解码每个消息,这在某些应用中可能是有益的。我们专注于一个特殊的识别码建设的基础上,两个级联的里德-所罗门码,并仔细看看它的实现,分析的权衡识别相对于传输和权衡引入的计算成本的识别码。

英文摘要:

In this paper we analyse 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑