Symmetric Disjunctive List-Decoding Codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Symmetric Disjunctive List-Decoding Codes


In 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.
Fichier principal
Vignette du fichier
wcc15-tu2-1.pdf (391.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01275864 , version 1 (18-02-2016)


  • HAL Id : hal-01275864 , version 1


A.G. d'Yachkov, I.V. Vorobyev, N.A. Polyanskii, V.Yu. Shchukin. Symmetric Disjunctive List-Decoding Codes. WCC2015 - 9th International Workshop on Coding and Cryptography 2015, Apr 2015, Paris, France. ⟨hal-01275864⟩


28 View
109 Download


Gmail Facebook X LinkedIn More