Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
From MaRDI portal
(Redirected from Publication:326306)
Recommendations
- On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders
- The smallest list for the arbitrarily varying channel
- Capacity of the arbitrarily varying channel under list decoding
- The maximal error capacity of arbitrarily varying channels for constant list sizes
- The secrecy capacity of the arbitrarily varying wiretap channel under list decoding
Cites work
- scientific article; zbMATH DE number 3702545 (Why is no real title available?)
- Arbitrarily varying channels with states sequence known to the sender
- Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
- Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true
- Bridging Shannon and Hamming: list error-correction with optimal rate
- Capacity of the arbitrarily varying channel under list decoding
- Capacity results for arbitrarily varying wiretap channels
- Coding of arbitrarily varying multiuser channels
- Efficient list decoding of a class of algebraic-geometry codes
- Elimination of correlation in random codes for arbitrarily varying channels
- List Decoding for Arbitrarily Varying Broadcast Channels With Receiver Side Information
- List decoding of matrix-product codes from nested codes: an application to quasi-cyclic codes
- List-Decoding for the Arbitrarily Varying Channel Under State Constraints
- On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding
- On the deterministic-code capacity of the multiple-access arbitrarily varying channel
- On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders
- Simultaneous channels
- The Arbitrarily Varying Multiple-Access Channel With Conferencing Encoders
- The Capacities of Certain Channel Classes Under Random Coding
- The Capacity of a Class of Channels
- The Compound Multiple Access Channel With Partially Cooperating Encoders
- The capacity of the arbitrarily varying channel revisited: positivity, constraints
- The classical-quantum multiple access channel with conferencing encoders and with common messages
- The discrete memoryless multiple access channel with partially cooperating encoders (Corresp.)
- The smallest list for the arbitrarily varying channel
- Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
Cited in
(7)- On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders
- The smallest list for the arbitrarily varying channel
- Impact of interference in coexisting wireless networks with applications to arbitrarily varying bidirectional broadcast channels
- The secrecy capacity of the arbitrarily varying wiretap channel under list decoding
- Structured Mappings and Conferencing Common Information for Multiple-Access Channels
- Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
- List Decoding for Arbitrarily Varying Multiple Access Channel Revisited: List Configuration and Symmetrizability
This page was built for publication: Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326306)
