nach oben

Designs, Codes and Cryptography

Erschienen in:

16.09.2016

Symmetric disjunctive list-decoding codes

verfasst von: A. G. D’yachkov, I. V. Vorobyev, N. A. Polyanskii, V. Yu. Shchukin

Erschienen in: Designs, Codes and Cryptography | Ausgabe 1-2/2017

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

In this work, we consider symmetric disjunctive list-decoding (SLD) codes, which are a class of binary codes based on a symmetric disjunctive sum (SDS) of binary symbols. By definition, the SDS takes values from the ternary alphabet \(\{0, 1, *\}\), where the symbol \(*\) denotes “erasure”. Namely: SDS is equal to 0 (1) if all its binary symbols are equal to 0 (1), otherwise SDS is equal to \(*\). The main purpose of this work is to obtain bounds on the rate of these codes.

Vorheriger Artikel Cover-free codes and separating system codes

Nächster Artikel Almost cover-free codes and designs

The adaptive symmetric group testing for the search of binomial sample was considered in [21].

Boneh D., Shaw J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inf. Theory 44(5), 1897–1905 (1998).CrossRefMATHMathSciNet

Cohen G.D., Schaathun H.G.: Asymptotic overview on separating codes. Technical Report 248, Department of Informatics, University of Bergen, Norway (2003).

Csiszar I., Korner J.: Information Theory: Coding Theorems for Discrete Memoryless Systems. Cambridge University Press, Cambridge (2011).CrossRefMATH

D’yachkov A.G.: Lectures on Designing Screening Experiments. Lecture Note Series 10, Combinatorial and Computational Mathematics Center, Pohang University of Science and Technology (POSTECH), Korea Republic (2003).

D’yachkov A.G., Rykov V.V.: An application of codes for the multiple access channel in the ALOHA communication system. In: Proccedings of the 6-th All-Union Seminar in Computing Networks, vol. 4, pp. 18–24. Moscow-Vinnitsa (1981) (in Russian).

D’yachkov A.G., Rykov V.V.: A survey of superimposed code theory. Probl. Inf. Transm. 12(4), 229–242 (1983).MATHMathSciNet

D’yachkov A.G., Rykov V.V.: Superimposed codes for multiple accessing of the OR-channel. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT). IEEE, Boston (1998).

D’yachkov A.G., Rykov V.V., Rashad A.M.: Superimposed distance codes. Probl. Inf. Transm. 18(4), 237–250 (1989).MATHMathSciNet

D’yachkov A.G., Vorobyev I.V., Polyanskii N.A., Shchukin V.Yu.: Bounds on the rate of superimposed codes. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), pp. 2341–2345. IEEE, Honolulu (2014).

10.

D’yachkov A.G., Vorobyev I.V., Polyanskii N.A., Shchukin V.Yu.: Bounds on the rate of disjunctive codes. Probl. Inf. Transm. 50(1), 27–56 (2014).

11.

D’yachkov A.G., Vorobyev I.V., Polyanskii N.A., Shchukin V.Yu.: Symmetric disjunctive list-decoding codes. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), pp. 2236–2240. IEEE, Hong Kong (2015).

12.

D’yachkov A.G., Vorobyev I.V., Polyanskii N.A., Shchukin V.Yu.: Almost disjunctive list-decoding codes. Probl. Inf. Transm. 51(2), 110–131 (2015).

13.

Friedman A.D., Graham R.L., Ullman J.D.: Universal single transition time asynchronous state assignments. IEEE Trans. Comput. 18(6), 541–547 (1969).CrossRef

14.

Galeev E.M., Tikhomirov V.M.: Optimization: Theory, Examples, Problems. Editorial URSS, Moscow (2000) (in Russian).

15.

Kautz W.H., Singleton R.C.: Nonrandom binary superimposed codes. IEEE Trans. Inf. Theory. 10(4), 363–377 (1964).CrossRefMATH

16.

Rashad A.M.: On symmetrical superimposed codes. J. Inf. Process. Cybern. 25(7), 337–341 (1989).MATHMathSciNet

17.

Shangguan C., Wang X., Ge G., Miao Y.: New Bounds For Frameproof Codes. Preprint, 2014. http://arxiv.org/pdf/1411.5782v1.

18.

Shchukin V.Yu.: List Decoding for a multiple-access hyperchannel. Probl. Inf. Transm. (will be published).

19.

Sholomov L.A.: Binary representation of underdetermined data. Dokl. Math. 87(1), 116–119 (2013).CrossRefMATHMathSciNet

20.

Sholomov L.A.: Binary representations of underdetermined data and superimposed codes. Appl. Discret. Math. 1, 17–33 (2013) (in Russian).

21.

Sobel M., Kumar S., Blumenthal S.: Symmetric binomial group-testing with three outcomes. In: Proceedings the Symposium on Statistical Decision Theory and Related Topics, pp. 119–160. Purdue University, Lafayette (1971).

22.

Vilenkin P.A.: On constructions of list-decoding superimposed codes. In: Proceedings of the 6th International Workshop on Algebraic and Combinatorial Coding Theory (ACCT-6), pp. 228–231. Pskov, Russia (1998).

Titel: Symmetric disjunctive list-decoding codes
verfasst von: A. G. D’yachkov
I. V. Vorobyev
N. A. Polyanskii
V. Yu. Shchukin
Publikationsdatum: 16.09.2016
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 1-2/2017
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-016-0278-4

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 1-2/2017

Revisiting (nested) Roos bias in RC4 key scheduling algorithm

Observing biases in the state: case studies with Trivium and Trivia-SC

Improving the security and efficiency of block ciphers based on LS-designs

Antiderivative functions over

Energy bounds for codes and designs in Hamming spaces

Improving impossible-differential attacks against Rijndael-160 and Rijndael-224