Pages that link to "Item:Q1174079"
From MaRDI portal
The following pages link to Random multiple access in binary feedback channel (Q1174079):
Displaying 17 items.
- Random multiple access in a vector disjunctive channel (Q383172) (← links)
- On ergodic algorithms in random multiple access systems with ``success-failure'' feedback (Q415719) (← links)
- Allowance for packet propagation time in random multiple access (Q792951) (← links)
- Upper bound on the capacity of a packet random multiple access system with errors (Q923043) (← links)
- Random multiple access system with impatient packets (Q1059044) (← links)
- Improved upper bound for the capacity of the random-access channel (Q1083424) (← links)
- Block transmission of information in a summing multiple access channel with feedback (Q1109002) (← links)
- Lower bound on delay in a random multiple access system (Q1179613) (← links)
- Random access algorithms with multiple reception capability and \(n\)-ary feedback channel (Q1310745) (← links)
- Random multiple access with known appearance times of successfully transmitted packets (Q1813426) (← links)
- Doubly randomized protocols for a random multiple access channel with ``success-nonsuccess'' feedback (Q2364464) (← links)
- On ergodic algorithms in systems of multiple access with partial feedback (Q2402172) (← links)
- Throughput of \(Q\)-ary splitting algorithms for contention resolution in communication networks (Q2493521) (← links)
- Throughput improvements using the random Leader technique for the reliable multicast wireless LANs (Q2777180) (← links)
- On multiple access channels with feedback (Corresp.) (Q3221875) (← links)
- (Q3332921) (← links)
- Optimizing a random access system by biased source blocking (Q3693416) (← links)
