Splitting algorithms in noisy channels with memory

DOI10.1109/18.42218MaRDI QIDQ4735127zbMATH OpenOpenAlexFDO

Authors Ilan Kessler, Moshe Sidi

Publication date 1989

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.42218

zbMATH Keywords

binary feedbackcommunication channelMultiaccess networksPoisson infinite-user modelslotted-time collision-type channeltwo-state first- order Markovian model

Mathematics Subject Classification ID

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

Recommendations

• Erasures and noise in splitting multiple access algorithms
• Throughput of \(Q\)-ary splitting algorithms for contention resolution in communication networks
• Random access algorithms with multiple reception capability and \(n\)-ary feedback channel
• Random multiple access in binary feedback channel
• On the instability of slotted ALOHA multiaccess algorithm

Cited in

(4)

• Throughput of \(Q\)-ary splitting algorithms for contention resolution in communication networks
• Splitting protocols in presence of capture
• Distributed communications in collision channels with errors
• Erasures and noise in splitting multiple access algorithms

This page was built for publication: Splitting algorithms in noisy channels with memory

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