Coding for a Multiple Access OR Channel: a Survey

DOI10.1016/j.endm.2005.07.048zbMath1158.94353OpenAlexW2172421970MaRDI QIDQ3439269

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Families of finite sets in which no set is covered by the union of \(r\) others
• On the upper bound of the size of the \(r\)-cover-free families
• On \(r\)-cover-free families
• Constructions of binary constant-weight cyclic codes and cyclically permutable codes
• Constructions of protocol sequences for multiple access collision channel without feedback
• New constructions of superimposed codes
• Nonrandom binary superimposed codes

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