A class of i.p.p. codes with efficient identification

An explicit construction is presented of t-i.p.p. q-ary codes of rate bounded away from zero, for which for any t /spl les/ q - 1 identification can be accomplished with complexity poly(n), where n is the code length.