Skip to Main content Skip to Navigation
Conference papers

Symmetric Disjunctive List-Decoding Codes

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-01275864
Contributor : Jean-Pierre Tillich <>
Submitted on : Thursday, February 18, 2016 - 1:09:34 PM
Last modification on : Wednesday, September 4, 2019 - 5:36:02 PM
Long-term archiving on: : Thursday, May 19, 2016 - 10:37:24 AM

File

wcc15-tu2-1.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01275864, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

53

Files downloads

274