Elimination of correlation in random codes for arbitrarily varying channels
From MaRDI portal
Publication:4145261
Recommendations
- Correlated sources help transmission over an arbitrarily varying channel
- On error exponents for arbitrarily varying channels
- Capacity of the arbitrarily varying channel under list decoding
- Arbitrarily varying channels with general alphabets and states
- Arbitrarily varying channels with constrained inputs and states
Cites work
- scientific article; zbMATH DE number 3173126 (Why is no real title available?)
- scientific article; zbMATH DE number 3496013 (Why is no real title available?)
- scientific article; zbMATH DE number 3598357 (Why is no real title available?)
- scientific article; zbMATH DE number 3438733 (Why is no real title available?)
- scientific article; zbMATH DE number 3451753 (Why is no real title available?)
- scientific article; zbMATH DE number 3215703 (Why is no real title available?)
- scientific article; zbMATH DE number 3288353 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- scientific article; zbMATH DE number 3318375 (Why is no real title available?)
- scientific article; zbMATH DE number 3417348 (Why is no real title available?)
- scientific article; zbMATH DE number 3201090 (Why is no real title available?)
- A Note on the Existence of the Weak Capacity for Channels with Arbitrarily Varying Channel Probability Functions and Its Relation to Shannon's Zero Error Capacity
- A note on a partial ordering for communication channels
- Channel capacities for list codes
- Channels with arbitrarily varying channel probability functions
- Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback
- Coding for a class of unknown channels
- Coding of sources with unknown statistics--I: Probability of encoding error
- Correlated decoding for channels with arbitrarily varying channel probability functions
- Me\fehler und Information
- Noiseless coding of correlated information sources
- On channels without a capacity
- On source coding with side information at the decoder
- Simultaneous channels
- Source coding with side information and a converse for degraded broadcast channels
- The Capacities of Certain Channel Classes Under Random Coding
- The Capacity of a Class of Channels
- The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet
- The source coding game
- Universal noiseless coding
Cited in
(38)- The classical-quantum multiple access channel with conferencing encoders and with common messages
- Positivity, discontinuity, finite resources, and nonzero error for arbitrarily varying quantum channels
- Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel
- Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels
- On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders
- Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
- On sparse approximations to randomized strategies and convex combinations
- Universal quantum state merging
- Ratewise-optimal non-sequential search strategies under constraints on the tests
- Exponential error bounds for random codes in the arbitrarily varying channel
- Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages
- Resource cost results for one-way entanglement distillation and state merging of compound and arbitrarily varying quantum sources
- Arbitrarily varying channels with states sequence known to the sender
- Arbitrarily varying and compound classical-quantum channels and a note on quantum zero-error capacities
- 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
- Entanglement-assisted classical capacities of compound and arbitrarily varying quantum channels
- Arbitrarily small amounts of correlation for arbitrarily varying quantum channels
- Strong secrecy for multiple access channels
- Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks
- Classical-quantum arbitrarily varying wiretap channel: secret message transmission under jamming attacks
- Trading quantum for classical resources in quantum data compression
- General theory of information transfer: Updated
- Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior
- Reliable communication under the influence of a state-constrained jammer: an information-theoretic perspective on receive diversity
- Secret message transmission over quantum channels under adversarial quantum noise: Secrecy capacity and super-activation
- Capacity results for arbitrarily varying wiretap channels
- Identification without randomization
- On the capacity of the arbitrarily varying channel for maximum probability of error
- Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
- Search with noisy and delayed response
- Oblivious Communication Channels and Their Capacity
- List decoding
- Classical-quantum arbitrarily varying wiretap channel: Ahlswede dichotomy, positivity, resources, super-activation
- Message transmission over classical quantum channels with a jammer with side information: correlation as resource, common randomness generation
- Semantic security for quantum wiretap channels
- Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity
- Localized random and arbitrary errors in the light of arbitrarily varying channel theory
This page was built for publication: Elimination of correlation in random codes for arbitrarily varying channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4145261)