Symmetric disjunctive list-decoding codes

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

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)211-229
Number of pages19
JournalDesigns, Codes, and Cryptography
Issue number1-2
Publication statusPublished - 1 Jan 2017
Externally publishedYes


  • Frameproof codes
  • Nonadaptive symmetric group testing
  • Random coding bounds
  • Separating codes
  • Symmetric disjunctive codes
  • Underdetermined data


Dive into the research topics of 'Symmetric disjunctive list-decoding codes'. Together they form a unique fingerprint.

Cite this