Symmetric disjunctive list-decoding codes |
| |
Authors: | A G D’yachkov I V Vorobyev N A Polyanskii V Yu Shchukin |
| |
Institution: | 1.Faculty of Mechanics and Mathematics,Lomonosov Moscow State University,Moscow,Russian Federation |
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|