An economical representation of underdeter-mined data and superimposed codes
For underdetermined data, economical representations making it possible to reconstruct the initial data are proposed. A connection between representations and superimposed codes is found, and bounds for representations length are obtained.
Download file
Counter downloads: 263
Keywords
представление недоопределённых данных, дизъюнктивный код, свободная от покрытий матрица, underdetermined data representation, superimposed code, cover-free matrixAuthors
| Name | Organization | |
| Sholomov L. A. | Institute of Systems Analysis, Russian Academy of Sciences (Moscow) | sholomov@isa.ru |
References
Шоломов Л. А. Элементы теории недоопределенной информации // Прикладная дискретная математика. Приложение. 2009. №2. С. 18-42.
Kautz W. H. and Singleton R. C. Nonrandom binary superimposed codes // IEEE Trans. Inform. Theory. 1964. V. 10. No. 4. P. 363-377.
Kumar R., Rajagopalan S., and Sahai A. Coding construction for blacklisting problems without computational assumptions // CRYPTO-99. LNCS. 1999. V. 1666. P. 609-623.
Шоломов Л. А. Двоичные представления недоопределённых данных и дизъюнктивные коды // Прикладная дискретная математика. 2013. №1(19). С. 17-33.
