Geodesic
An economical representation of underdetermined data and superimposed codes
Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 27-29.

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: underdetermined data representation, superimposed code, cover-free matrix. 
@article{PDMA_2013_6_a13,
     author = {L. A. Sholomov},
     title = {An economical representation of underdetermined data and superimposed codes},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {27--29},
     publisher = {mathdoc},
     number = {6},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2013_6_a13/}
}
TY  - JOUR
AU  - L. A. Sholomov
TI  - An economical representation of underdetermined data and superimposed codes
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2013
SP  - 27
EP  - 29
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2013_6_a13/
LA  - ru
ID  - PDMA_2013_6_a13
ER  - 
%0 Journal Article
%A L. A. Sholomov
%T An economical representation of underdetermined data and superimposed codes
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2013
%P 27-29
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2013_6_a13/
%G ru
%F PDMA_2013_6_a13
L. A. Sholomov. An economical representation of underdetermined data and superimposed codes. Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 27-29. http://geodesic.mathdoc.fr/item/PDMA_2013_6_a13/

[1] Sholomov L. A., “Elementy teorii nedoopredelennoi informatsii”, Prikladnaya diskretnaya matematika. Prilozhenie, 2009, no. 2, 18–42

[2] Kautz W. H., Singleton R. C., “Nonrandom binary superimposed codes”, IEEE Trans. Inform. Theory, 10:4 (1964), 363–377 | DOI | Zbl

[3] Kumar R., Rajagopalan S., Sahai A., “Coding construction for blacklisting problems without computational assumptions”, CRYPTO-99, LNCS, 1666, 1999, 609–623 | Zbl

[4] Sholomov L. A., “Dvoichnye predstavleniya nedoopredelennykh dannykh i diz'yunktivnye kody”, Prikladnaya diskretnaya matematika, 2013, no. 1(19), 17–33