https://hal.inria.fr/hal-01275864d'Yachkov, A.G.A.G.d'YachkovMSU - Lomonosov Moscow State UniversityVorobyev, I.V.I.V.VorobyevMSU - Lomonosov Moscow State UniversityPolyanskii, N.A.N.A.PolyanskiiMSU - Lomonosov Moscow State UniversityShchukin, V.Yu.V.Yu.ShchukinMSU - Lomonosov Moscow State UniversitySymmetric Disjunctive List-Decoding CodesHAL CCSD2016Symmetric disjunctive codesrandom coding boundsnonadaptive symmetric group testing[INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT]Tillich, Jean-PierrePascale Charpin, Nicolas Sendrier, Jean-Pierre Tillich2016-02-18 13:09:342019-09-04 17:36:022016-02-19 10:59:57enConference papersapplication/pdf1In this paper, 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.