Modulo-2 separable linear codes

Gregory Poltyrev, Jakov Snyders

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Transmission of information through a multiple access chan­nel 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.

Original languageEnglish
Title of host publicationAlgebraic Coding - 1st French-Israeli Workshop, Proceedings
EditorsGerard Cohen, Antoine Lobstein, Gilles Zemor, Simon Litsyn
PublisherSpringer Verlag
Pages22-27
Number of pages6
ISBN (Print)9783540578437
DOIs
StatePublished - 1994
Event1st French-Israeli Workshop on Algebraic Coding, 1993 - Paris, France
Duration: 19 Jul 199321 Jul 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume781 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st French-Israeli Workshop on Algebraic Coding, 1993
Country/TerritoryFrance
CityParis
Period19/07/9321/07/93

Funding

FundersFunder number
Basic Research Foundation administrated
Israel Academy of Sciences and Humanities
Ministry of Science and Technology, Israel

    Fingerprint

    Dive into the research topics of 'Modulo-2 separable linear codes'. Together they form a unique fingerprint.

    Cite this