1. Home
    Item seperator
  3. Item seperator
    A Class of I.P.P. Codes with Efficient Identification

A Class of I.P.P. Codes with Efficient Identification

New Image

An explicit construction will be presented of t-i.p.p. codes of rate bounded away from zero, for which identification can be accomplished with complexity poly(n). This result solves an open problem put forward in J.N. Staddon et al. IEEE Trans. Inform. Theory, vol 47 (2001), pp. 1042-1049.