@inproceedings{f850de8deaaa472d85b3189b2965d4d2,
title = "Modulo-2 separable linear codes",
abstract = "Transmission of information through a multiple access channel is addressed for the situation that out of a fixed family of N potential users at most some m, m < N, are active simultaneously. We assign codes to the N users in a way that allows correction of any t or less errors and separate the s ≤ m messages, provided that the subset of active users is known to the receiver. The construction of codes is tightly connected with a construction of maximum distance codes. A decoding procedure is presented.",
author = "Gregory Poltyrev and Jakov Snyders",
note = "Publisher Copyright: {\textcopyright} 1994, Springer Verlag. All Rights Reserved.; 1st French-Israeli Workshop on Algebraic Coding, 1993 ; Conference date: 19-07-1993 Through 21-07-1993",
year = "1994",
doi = "10.1007/3-540-57843-9_3",
language = "אנגלית",
isbn = "9783540578437",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "22--27",
editor = "Gerard Cohen and Antoine Lobstein and Gilles Zemor and Simon Litsyn",
booktitle = "Algebraic Coding - 1st French-Israeli Workshop, Proceedings",
}