A Class of I.P.P. Codes with Efficient Identification
An explicit construction is presented of t-i.p.p. codes of rate bounded away from zero, for which identification can be accomplished with complexity poly(n).
We have limited content available for some countries. Find office information and country specific information through our country hub.
We have limited content available for some countries. Find office information and country specific information through our country hub.
An explicit construction is presented of t-i.p.p. codes of rate bounded away from zero, for which identification can be accomplished with complexity poly(n).