Random multiple access in a vector disjunctive channel

DOI10.1134/S0032946013020026zbMath1283.94036OpenAlexW2025494527MaRDI QIDQ383172

E. V. Pustovalov, A. M. Tyurlikov

Publication date: 25 November 2013

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946013020026

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• Unnamed Item
• On the asymptotic capacity of a multi-access channel
• Bounds on the capacity of FCFS multiple-access algorithms
• Tree algorithms for packet broadcast channels
• High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm
• Survey of USSR contributions to random multiple-access communications
• On the T-user M-frequency noiseless multiple-access channel with and without intensity information

This page was built for publication: Random multiple access in a vector disjunctive channel