Capacity and decoding rules for classes of arbitrarily varying channels
Explore this paper's citation graph
Summary
For a large class of addictive AVCs, in addition to providing an intuitively suggestive simplification of the general AVC capacity formula, it is proven that capacity can be attained by a universal decoding rule.
- Type
- article
- Published
- 1989-07-01
- Cited by
- 39
- References
- 18
- Access
- Open access
- OpenAlex
- https://openalex.org/W2076613277
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:12906557
Keywords
Decoding methods, Mutual information, Constraint (computer-aided design), Channel capacity, Computer science
References
- On the capacity of the arbitrarily varying channel for maximum probability of error
- On the capacity of computer memory with defects
- The capacity of the arbitrarily varying channel revisited: Positivity, constraints
- Arbitrarily varying channels with states sequence known to the sender
- Arbitrarily varying channels with constrained inputs and states
- The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet
- Elimination of correlation in random codes for arbitrarily varying channels
- Graph decomposition: A new key to coding theorems
- Communication in the Presence of Jamming-An Information-Theoretic Approach
Cited by
- Robust and adaptive communication under uncertain interference
- Optimal Rate Code Constructions for Computationally Simple Channels
- Explicit Capacity-achieving Codes for Worst-Case Additive Errors
- On the capacity of memoryless adversary
- On the capacity region of the discrete additive multiple-access arbitrarily varying channel
- Arbitrarily varying channels with general alphabets and states
- Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit
- Fifty Years of Shannon Theory
- Capacity of the Gaussian arbitrarily varying channel
- Capacity and decoding rules for the Poisson arbitrarily varying chann
- State constraints for the multiple-access arbitrarily varying channel
- The Capacity Region Of The Additive Multiple Access Arbitrarily Varying Channel
- Reliable Communication Under Channel Uncertainty
- Oblivious Communication Channels and Their Capacity
- On the deterministic-code capacity of the multiple-access arbitrarily varying channel
- Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate
- Erasure, list, and detection zero-error capacities for low noise and a relation to identification
- Universal linear least-squares prediction
- Channel capacity for a given decoding metric
- The Method of Types
Related papers
- Research of modified IRA decoding algorithm based on offset approximation
- Adaptive LDPC Decoding Algorithm based on Theory of Density Evolution
- Information-Theoretic Foundations of Mismatched Decoding
- The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel
- List-Decoding for the Arbitrarily Varying Channel Under State Constraints
- On Information Rates for Mismatched Decoders
- Reliability information in channel decoding: practical aspects and information theoretical bounds