A class of i.p.p. codes with efficient identification was discussed. An explicit construction of i.p.p. q-ary codes of rate bounded away from zero was presented. Results showed that the polynomial complexity bounds claimed in the theorem hold good because the constituent codes could be constructed in time polynomial in n.
|Number of pages||1|
|Journal||IEEE International Symposium on Information Theory - Proceedings|
|Publication status||Published - 2002|
|Event||2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland|
Duration: 30 Jun 2002 → 5 Jul 2002