A toolbox for refined information-theoretic analyses
From MaRDI portal
Cites work
- A Lagrange–Dual Lower Bound to the Error Exponent of the Typical Random Code
- A Large Deviations Approach to Secure Lossy Compression
- A large-deviations notion of perfect secrecy
- A lower bound on the probability of a union
- A Mathematical Theory of Communication
- A new achievable rate region for the interference channel
- A new extension of quantum Simpson's and quantum Newton's type inequalities for quantum differentiable convex functions
- A simple derivation of the coding theorem and some applications
- An achievable rate region for the multiple-access channel with feedback
- Analytic Information Theory
- Apéry polynomials and the multivariate saddle point method
- Asymmetric Evaluations of Erasure and Undetected Error Probabilities
- Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities
- Asymptotic evaluation of certain markov process expectations for large time. IV
- Asymptotically Optimal Tests for Finite Markov Chains
- Asynchronous Capacity per Unit Cost
- Asynchronous Communication: Capacity Bounds and Suboptimality of Training
- Biometric security from an information-theoretical perspective
- Bounds on the average error probability for a code ensemble with fixed composition
- Broadcast channels
- Broadcast channels with confidential messages
- Buffer overflow in variable length coding of fixed rate sources
- Capacity and Random-Coding Exponents for Channel Coding With Side Information
- Capacity theorems for the relay channel
- Capacity/Storage Tradeoff in High-Dimensional Identification Systems
- Channel coding with multilevel/phase signals
- Channel Detection in Coded Communication
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- Codeword or Noise? Exact Random Coding Exponents for Joint Detection and Decoding
- Coding in the Finite-Blocklength Regime: Bounds Based on Laplace Integrals and Their Asymptotic Approximations
- Communication Under Strong Asynchronism
- Compression for Quadratic Similarity Queries
- Concentration inequalities. A nonasymptotic theory of independence
- Concentration of measure inequalities in information theory, communications, and coding
- Concentration properties of random codes
- Converses of the Jensen inequality derived from the Green functions with applications in information theory
- Correction to “The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds” [Aug 17 5039-5051]
- D-semifaithful codes that are universal over both memoryless sources and distortion measures
- Duality between source coding and channel coding and its extension to the side information case
- Elements of Information Theory
- Ensemble Performance of Biometric Authentication Systems Based on Secret Key Generation
- Erasure/List Exponents for Slepian–Wolf Decoding
- Erasure/List Random Coding Error Exponents Are Not Universally Achievable
- Error Exponent for Multiple-Access Channels: Lower Bounds
- Error Exponents for Broadcast Channels With Degraded Message Sets
- Error Exponents in the Bee Identification Problem
- Error Exponents of Erasure/List Decoding Revisited Via Moments of Distance Enumerators
- Error Exponents of Optimum Decoding for the Interference Channel
- Error exponents of the dirty-paper and Gel'fand-Pinsker channels
- Error Exponents of Typical Random Codes
- Error Exponents of Typical Random Codes for the Colored Gaussian Channel
- Error Exponents of Typical Random Trellis Codes
- Estimating the dimension of a model
- Evaluation of expurgated bound exponents
- Exact Correct-Decoding Exponent of the Wiretap Channel Decoder
- Exact Error and Erasure Exponents for the Asymmetric Broadcast Channel
- Exact Random Coding Error Exponents of Optimal Bin Index Decoding
- Exact Random Coding Exponents and Universal Decoders for the Asymmetric Broadcast Channel
- Exact Random Coding Exponents for Erasure Decoding
- Exact Random Coding Secrecy Exponents for the Wiretap Channel
- Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification
- Exponential error bounds for erasure, list, and decision feedback schemes
- Exponential-type error probabilities for multiterminal hypothesis testing
- Expurgated Bounds for the Asymmetric Broadcast Channel
- Expurgated Random-Coding Ensembles: Exponents, Refinements, and Connections
- Fundamentals of Wireless Communication
- Further reverse results for Jensen's discrete inequality and applications in information theory
- Gaussian Intersymbol Interference Channels With Mismatch
- General broadcast channels with degraded message sets
- General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel
- Generalized Random Gilbert-Varshamov Codes
- Generalized random Gilbert-Varshamov codes: typical error exponent and concentration properties
- Good codes can be produced by a few permutations
- Graph decomposition: A new key to coding theorems
- Guessing subject to distortion
- scientific article; zbMATH DE number 410740 (Why is no real title available?)
- scientific article; zbMATH DE number 3886512 (Why is no real title available?)
- scientific article; zbMATH DE number 3115443 (Why is no real title available?)
- scientific article; zbMATH DE number 3143813 (Why is no real title available?)
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 4216751 (Why is no real title available?)
- scientific article; zbMATH DE number 5719292 (Why is no real title available?)
- scientific article; zbMATH DE number 3826980 (Why is no real title available?)
- scientific article; zbMATH DE number 3666658 (Why is no real title available?)
- scientific article; zbMATH DE number 3521856 (Why is no real title available?)
- scientific article; zbMATH DE number 3531282 (Why is no real title available?)
- scientific article; zbMATH DE number 3555863 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1153603 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 7434519 (Why is no real title available?)
- scientific article; zbMATH DE number 3278949 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- scientific article; zbMATH DE number 3322635 (Why is no real title available?)
- scientific article; zbMATH DE number 3405822 (Why is no real title available?)
- scientific article; zbMATH DE number 3200971 (Why is no real title available?)
- Hypothesis testing and information theory
- Hypothesis testing with communication constraints
- Information theoretic security
- Information theory. Coding theorems for discrete memoryless systems
- Information-Theoretic Foundations of Mismatched Decoding
- Information, Physics, and Computation
- Introduction to complex analysis. Transl. from the German by T. Kövari and G. S. Goodman
- Joint Source–Channel Coding Excess Distortion Exponent for Some Memoryless Continuous-Alphabet Systems
- Large Deviations Behavior of the Logarithmic Error Probability of Random Codes
- Large deviations, hypotheses testing, and source coding for finite Markov chains
- Lattice coding for signals and networks. A structured coding approach to quantization, modulation, and multiuser information theory. With contributions by Bobak Nazer and Yuval Kochman
- List Decoding—Random Coding Exponents and Expurgated Exponents
- Lower Bounds on Exponential Moments of the Quadratic Error in Parameter Estimation
- Lower bounds to error probability for coding on discrete memoryless channels. I
- Minimax Universal Decoding With an Erasure Option
- Mismatched Decoding: Error Exponents, Second-Order Rates and Saddlepoint Approximations
- Mismatched Multi-Letter Successive Decoding for the Multiple-Access Channel
- Moderate Deviations in Channel Coding
- Modern Coding Theory
- Multiuser Random Coding Techniques for Mismatched Decoding
- Network information theory
- New converses of Jensen inequality via Green functions with applications
- New versions of Suen's correlation inequality
- Noiseless coding of correlated information sources
- On a new converse of Jensen's inequality
- On Deviations of the Sample Mean
- On general minimax theorems
- On information rates for mismatched decoders
- On More General Distributions of Random Binning for Slepian–Wolf Encoding
- On optimum strategies for minimizing the exponential moments of a loss function
- On the converse to the coding theorem for discrete memoryless channels (Corresp.)
- On the Dispersions of the Gel’fand–Pinsker Channel and Dirty Paper Coding
- On the Optimality of Binning for Distributed Hypothesis Testing
- On the Reliability Function of Distributed Hypothesis Testing Under Optimal Detection
- On Universal Simulation of Information Sources Using Training Data
- Optimal Sequential Frame Synchronization
- Optimal sequential probability assignment for individual sequences
- Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources
- Optimum Tradeoffs Between the Error Exponent and the Excess-Rate Exponent of Variable-Rate Slepian–Wolf Coding
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Random codes: minimum distances and error exponents
- Random coding bounds for discrete memoryless channels
- Random Coding Error Exponents for the Two-User Interference Channel
- Random-energy model: an exactly solvable model of disordered systems
- Refinement of the Random Coding Bound
- Relations Between Random Coding Exponents and the Statistical Physics of Random Codes
- Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)
- Reliability in Source Coding With Side Information
- Reliability of universal decoding based on vector-quantized codewords
- Second-Order and Moderate Deviation Asymptotics for Successive Refinement
- Second-Order Asymptotics for the Gaussian MAC With Degraded Message Sets
- Simplified Erasure/List Decoding
- Some new quantum Hermite-Hadamard-like inequalities for coordinated convex functions
- Some reverses of the Jensen inequality for functions of selfadjoint operators in Hilbert spaces
- Some reverses of the Jensen inequality with applications
- Statistical inference under multiterminal data compression
- Statistical Methods in Markov Chains
- Statistical Physics and Information Theory
- Statistical Physics of Random Binning
- The capacity of the white Gaussian multiple access channel with feedback
- The error exponent for the noiseless encoding of finite ergodic Markov sources
- The estimation of the model order in exponential families
- The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds
- The Log-Volume of Optimal Codes for Memoryless Channels, Asymptotically Within a Few Nats
- The method of types [information theory]
- The performance of universal encoding
- The random coding bound is tight for the average code (Corresp.)
- The rate-distortion function for source coding with side information at the decoder
- The Wire-Tap Channel
- Universal coding for the Slepian-Wolf data compression system and the strong converse theorem
- Universal composite hypothesis testing: a competitive minimax approach
- Universal Decoding for Arbitrary Channels Relative to a Given Class of Decoding Metrics
- Universal Decoding for Asynchronous Slepian-Wolf Encoding
- Universal Decoding for Gaussian Intersymbol Interference Channels
- Universal decoding for memoryless Gaussian channels with a deterministic interference
- Universal decoding for source-channel coding with side information
- Universal Decoding for the Typical Random Code and for the Expurgated Code
- Universal noiseless coding
- Universally attainable error exponents for broadcast channels with degraded message sets
- Writing on dirty paper (Corresp.)
This page was built for publication: A toolbox for refined information-theoretic analyses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7014275)
