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

Alexander Barg, Gregory Kabatiansky

Research output: Contribution to journalConference articlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)440
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
Publication statusPublished - 2002
Externally publishedYes
Event2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland
Duration: 30 Jun 20025 Jul 2002

Fingerprint

Dive into the research topics of 'A class of i.p.p. codes with efficient identification'. Together they form a unique fingerprint.

Cite this