Abstract
In this paper we show an explicit relation between authentication codes and codes correcting independent errors. This relation gives rise to several upper bounds on A-codes. We also show how to construct A-codes starting from error correcting codes. The latter is used to show that if PS exceeds PI by an arbitrarily small positive amount, then the number of source states grows exponentially with the number of keys but if PS = PI it will grow only linearly.
Cite
CITATION STYLE
Johansson, T., Kabatianskii, G., & Smeets, B. (1994). On the relation between a-codes and codes correcting independent errors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 765 LNCS, pp. 1–11). Springer Verlag. https://doi.org/10.1007/3-540-48285-7_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
