Codes for adversaries: between worst-case and average-case jamming
From MaRDI portal
Cites work
- A characterization of the capacity of online (causal) binary channels
- A coding scheme for additive noise channels with feedback--I: No bandwidth constraint
- A complete characterization of minimax and maximin encoder- decoder policies for communication channels with incomplete statistical description
- A Mathematical Theory of Communication
- 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 strange pigeon-hole principle
- A survey of results for deletion channels and related synchronization channels
- Achieving the Empirical Capacity Using Feedback: Memoryless Additive Models
- An algorithm for computing the capacity of arbitrary discrete memoryless channels
- An Efficient Feedback Coding Scheme With Low Error Probability for Discrete Memoryless Channels
- Arbitrarily varying channels with constrained inputs and states
- Arbitrarily varying channels with states sequence known to the sender
- Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true
- Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
- Capacity and decoding rules for classes of arbitrarily varying channels
- Capacity of non-malleable codes
- Capacity of the Gaussian arbitrarily varying channel
- Capacity theorems for the relay channel
- Causal erasure channels
- Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback
- Codes for computationally simple channels: explicit constructions with optimal rate
- Codes in the Space of Multisets—Coding for Permutation Channels With Impairments
- Coding for the $\boldsymbol \ell _\infty $ -Limited Permutation Channel
- Coding of arbitrarily varying multiuser channels
- Coding Theorems for Noisy Permutation Channels
- Communication Over Individual Channels
- Communication Theory of Secrecy Systems*
- Computation of channel capacity and rate-distortion functions
- Cooperative Strategies and Capacity Theorems for Relay Networks
- Coordination Capacity
- Correlated decoding for channels with arbitrarily varying channel probability functions
- Correlated Jamming on MIMO Gaussian Fading Channels
- Decoding of Reed Solomon codes beyond the error-correction bound
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Distributed Channel Synthesis
- Elimination of correlation in random codes for arbitrarily varying channels
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- Error correcting codes that achieve BSC capacity against channels that are poly-size circuits
- Error detecting and error correcting codes
- Error-correcting codes for list decoding
- Explicit capacity-achieving list-decodable codes
- Explicit List-decodable codes with optimal rate for computationally bounded channels
- Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity
- Exponential Decay of Intersection Volume With Applications on List-Decodability and Gilbert-Varshamov Type Bound
- Exponential error bounds for random codes in the arbitrarily varying channel
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- From seven to eleven: completely positive matrices with high cp-rank
- Gaussian arbitrarily varying channels
- Generalized privacy amplification
- scientific article; zbMATH DE number 3133919 (Why is no real title available?)
- scientific article; zbMATH DE number 3872359 (Why is no real title available?)
- scientific article; zbMATH DE number 3970683 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3666658 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3497786 (Why is no real title available?)
- scientific article; zbMATH DE number 3566730 (Why is no real title available?)
- scientific article; zbMATH DE number 1088243 (Why is no real title available?)
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- scientific article; zbMATH DE number 2135142 (Why is no real title available?)
- scientific article; zbMATH DE number 1420989 (Why is no real title available?)
- scientific article; zbMATH DE number 3410920 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- scientific article; zbMATH DE number 3062467 (Why is no real title available?)
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Improving the Gilbert–Varshamov Bound for<tex>$q$</tex>-Ary Codes
- Information Capacity of Channels with Partially Unknown Noise. I. Finite-Dimensional Channels
- Information theory. Coding theorems for discrete memoryless systems
- Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
- Linking information reconciliation and privacy amplification
- List decoding from erasures: bounds and code constructions
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- Lower bounds to error probability for coding on discrete memoryless channels. I
- Maximum distance<tex>q</tex>-nary codes
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Multiterminal secrecy by public discussion
- Mutual Information Games in Multiuser Channels With Correlated Jamming
- Network information theory
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- Non-malleable codes
- Non-malleable codes from additive combinatorics (extended abstract)
- Non-malleable codes from two-source extractors
- Non-malleable coding against bit-wise and split-state tampering
- Nonconvexity of the capacity region of the multiple-access arbitrarily varying channel subject to constraints
- On error exponents for arbitrarily varying channels
- On general minimax theorems
- On Sequences of Pairs of Dependent Random Variables
- On the capacity of channels with block memory
- On the capacity of the arbitrarily varying channel for maximum probability of error
- On the Capacity of the Noncausal Relay Channel
- On the deterministic-code capacity of the multiple-access arbitrarily varying channel
- Optimal Feedback Communication Via Posterior Matching
- Optimum coding and decoding schemes for the transmission of a stochastic process over a continuous-time stochastic channel with partially unknown statisticst†
- Optimum linear causal coding schemes for Gaussian stochastic processes in the presence of correlated jamming
- Polynomial Codes Over Certain Finite Fields
- Privacy Amplification by Public Discussion
- Quasilinear time list-decodable codes for space bounded channels
- Rateless Codes for AVC Models
- Recent developments in graph Ramsey theory
- Relay Networks With Delays
- Reliable communication under channel uncertainty
- Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes
- Sequential transmission using noiseless feedback
- Sharpening the Gilbert-Varshamov bound in the finite case
- Solutions to a class of minimax decision problems arising in communication systems
- Some Information Theoretic Saddlepoints
- Some results on the existence of binary linear codes (Corresp.)
- State constraints for the multiple-access arbitrarily varying channel
- Strengthening the Gilbert-Varshamov bound
- Strong Coordination Over Multi-Hop Line Networks Using Channel Resolvability Codebooks
- Sufficiently Myopic Adversaries Are Blind
- The Arbitrarily Varying Broadcast Channel With Causal Side Information at the Encoder
- The Arbitrarily Varying Channel Under Constraints With Side Information at the Encoder
- The Capacities of Certain Channel Classes Under Random Coding
- The Capacity of a Class of Channels
- The Capacity of Online (Causal) q -Ary Error-Erasure Channels
- The capacity of the arbitrarily varying channel revisited: positivity, constraints
- The common information of two dependent random variables
- The Gaussian test channel with an intelligent jammer
- The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]
- The smallest list for the arbitrarily varying channel
- The strong converse theorem in the decoding scheme of list size L
- The Wire-Tap Channel
- The Zero-Rate Threshold for Adversarial Bit-Deletions is Less Than 1/2
- Three-terminal communication channels
- Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
- Two theorems on list decoding (extended abstract)
- Upper Bounds on the Capacity of Binary Channels With Causal Adversaries
- Zero-error information theory
- Zero-Rate Feedback Can Achieve the Empirical Capacity
- Über höhere Kongruenzen.
This page was built for publication: Codes for adversaries: between worst-case and average-case jamming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7035570)
