Coding for a Multiple Access OR Channel: a Survey

DOI10.1016/J.ENDM.2005.07.048MaRDI QIDQ3439269zbMATH OpenOpenAlexFDO

Authors Sándor Győri

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.07.048

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Cites work

• scientific article; zbMATH DE number 3831842 (Why is no real title available?)
• scientific article; zbMATH DE number 3841775 (Why is no real title available?)
• scientific article; zbMATH DE number 4064918 (Why is no real title available?)
• scientific article; zbMATH DE number 3801449 (Why is no real title available?)
• Constructions of binary constant-weight cyclic codes and cyclically permutable codes
• Constructions of protocol sequences for multiple access collision channel without feedback
• Families of finite sets in which no set is covered by the union of \(r\) others
• New constructions of superimposed codes
• Nonrandom binary superimposed codes
• On r-cover-free families
• On the upper bound of the size of the \(r\)-cover-free families

This page was built for publication: Coding for a Multiple Access OR Channel: a Survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439269)