Title :
A class of i.p.p. codes with efficient identification
Author :
Barg, Alexander ; Kabatiansky, Gregory
Author_Institution :
Lucent Technol. Bell Labs., Murray Hill, NJ, USA
Abstract :
An explicit construction is presented of t-i.p.p. q-ary codes of rate bounded away from zero, for which for any t ≤ q - 1 identification can be accomplished with complexity poly(n), where n is the code length.
Keywords :
codes; computational complexity; cryptography; identification; polynomials; code length; efficient identification; i.p.p. codes; polynomial complexity bounds; q-ary codes; Decoding; Geometry;
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
DOI :
10.1109/ISIT.2002.1023712
