Random multiple access in binary feedback channel

MaRDI QIDQ1174079zbMATH OpenFDO

Authors B. S. Tsybakov, A. N. Beloyarov

Publication date 25 June 1992

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

zbMATH Keywords

upper boundsbinary feedback channelspacket delaysrandom multiple-access algorithms

Mathematics Subject Classification ID

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

Recommendations

• Random multiple access in a channel with binary ``success-no success feedback
• Random access algorithms with multiple reception capability and \(n\)-ary feedback channel
• On ergodic algorithms in systems of multiple access with partial feedback
• Some new random multiple-access algorithms
• Packet Multiple Access for Channel With Binary Feedback, Capture, and Multiple Reception

Cited in

(25)

• scientific article; zbMATH DE number 3874593 (Why is no real title available?)
• Improved upper bound for the capacity of the random-access channel
• Random multiple access system with impatient packets
• Doubly randomized protocols for a random multiple access channel with ``success-nonsuccess feedback
• Packet Multiple Access for Channel With Binary Feedback, Capture, and Multiple Reception
• Upper bound on the capacity of a packet random multiple access system with errors
• On ergodic algorithms in random multiple access systems with ``success-failure feedback
• Random access algorithms with multiple reception capability and \(n\)-ary feedback channel
• On ergodic algorithms in systems of multiple access with partial feedback
• Poisson multiple-access contention with binary feedback
• Delay analysis of interval-searching contention resolution algorithms
• Throughput of \(Q\)-ary splitting algorithms for contention resolution in communication networks
• Optimizing a random access system by biased source blocking
• On multiple access channels with feedback (Corresp.)
• Analytic properties of multiple-access trees
• Random multiple access in a vector disjunctive channel
• Block transmission of information in a summing multiple access channel with feedback
• Limited feedback sensing algorithms for the packet broadcast channel
• scientific article; zbMATH DE number 3932930 (Why is no real title available?)
• Splitting algorithms in noisy channels with memory
• scientific article; zbMATH DE number 3865145 (Why is no real title available?)
• Allowance for packet propagation time in random multiple access
• Delay analysis of the n-ary stack random-access algorithm
• scientific article; zbMATH DE number 1717210 (Why is no real title available?)
• Random multiple access in a channel with binary ``success-no success feedback

This page was built for publication: Random multiple access in binary feedback channel

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