A class of I.P.P. codes with efficient identification

  • Authors:

  • Alexander Barg;Gregory Kabatiansky

  • Affiliations:

  • DIMACS, Rutgers University, 96 Frelinghuysen Rd., Piscataway, NJ and Department of Electrical and Computer Engineering, University of Maryland, 2361 A.V. Williams Bldg., College Park, MD;IPPI RAN, Bol'shoj Karetnyj 19, Moscow 101447, Russia

  • Venue:
  • Journal of Complexity - Special issue on coding and cryptography
  • Year:
  • 2004

Quantified Score

Hi-index 0.01

Visualization

Abstract

Let C be a code of length n over a q-ary alphabet. An n-word y is called a descendant of a set of t codewords x1, ..., xt if yi ∈ {xi1, ..., xit} for all i = 1, ..., n. A code is said to have the t-identifying parent property (t-i.p.p.) if for any n-word y that is a descendant of at most t parents it is possible to identify at least one of them.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).