Lower bounds to error probability for coding on discrete memoryless channels. I

Recommendations

A simple derivation of the coding theorem and some applications
Lower bound for error probability in a discrete memoryless channel with feedback
Error estimates for low rate codes
scientific article; zbMATH DE number 3242951
On the converse to the coding theorem for discrete memoryless channels (Corresp.)

Cited in

(72)

Sharpening of an upper bound for the reliability function of a binary symmetric channel
The sphere packing bound for memoryless channels
Lower Bounds on the Error Probability of Block Codes Based on Improvements on de Caen's Inequality
Noiseless coding of error detection information (Corresp.)
Entropy inequalities for discrete channels
Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
scientific article; zbMATH DE number 3937097 (Why is no real title available?)
scientific article; zbMATH DE number 3670354 (Why is no real title available?)
An upper bound on error probability in communication systems with single-user reception based on order statistics
Coding theorems for the nonsynchronized channel
The strong converse theorem in the decoding scheme of list size L
On the reliability function for a BSC with noisy feedback
Random coding bound for E-capacity of DMC with stochastic encoding
Obituary: Claude Elwood Shannon 1916-2001
List decodability at small radii
scientific article; zbMATH DE number 3675781 (Why is no real title available?)
Code volume boundaries in the additive channel
Notes on the asymptotic behavior of the information rate of block codes (Corresp.)
Decentralized detection by a large number of sensors
Code spectrum and the reliability function: Gaussian channel
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
Error Exponents for Variable-Length Block Codes With Feedback and Cost Constraints
The exponent of error probability in various modulation and coding systems
Chernoff bounds for discriminating between two markov processes
Error exponents of codings for stationary Gaussian channels
A toolbox for refined information-theoretic analyses
Error exponents for two-hop Gaussian multiple source-destination relay channels
Constructive codes for arbitrary discrete memoryless channels
A coding theorem for multiple access channels using a maximum likelihood list decoding scheme
A simple derivation of the lower bound to<tex>R_{mbox{comp}}</tex>for discrete memoryless channels (Corresp.)
Lower bound for ensemble-average error probability for a discrete memoryless channel
Lower bounds for the cardinality of error-correcting codes in channels with multiple access
Codes for adversaries: between worst-case and average-case jamming
Minimum output symbol error variance of forward error control codes
Capacity and a lower bound to<tex>R_{mbox{comp}}</tex>for a channel with symbol fission
Error exponent of activated non-signaling-assisted classical-quantum channel coding
On the BSC reliability function: expanding the region where it is known exactly
Code spectrum and the reliability function: binary symmetric channel
Capacity and error exponents of stationary point processes under random additive displacements
A simple derivation of the refined sphere packing bound under certain symmetry hypotheses
scientific article; zbMATH DE number 3405822 (Why is no real title available?)
Random coding bounds for discrete memoryless channels
Reed-Muller Codes
A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels
Erratum to: ``Bounds on the rate of disjunctive codes
Error estimates for low rate codes
Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vlăduţ-Zink bounds
Sphere-Packing Bounds Revisited for Moderate Block Lengths
The Minimum Average Code for Finite Memoryless Monotone Sources
On the converse to the coding theorem for discrete memoryless channels (Corresp.)
Second-order converses via reverse hypercontractivity
On the capacity of channels with block memory
Rate optimal Chernoff bound and application to community detection in the stochastic block models
Bounds on the achievable rates of block coding for a memoryless multiple-access channel
Lower bound for error probability in a discrete memoryless channel with feedback
Random-coding bounds for some broadcast channels
Diagnostische Vorgabeexperimente mit stochastischen Automaten. (Diagnosing preset experiments with stochastic automata)
A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels
Very noisy channels, reliability functions, and exponentially optimum codes
scientific article; zbMATH DE number 4009475 (Why is no real title available?)
Coding in a channel with generalized defects and random errors
A lower bound on average codeword length of variable length error-correcting codes
A new lower bound for the a-mean error of parameter transmission over the white Gaussian channel
Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)
scientific article; zbMATH DE number 3412515 (Why is no real title available?)
Quantum \(f\)-divergences via Nussbaum-Szkoła distributions and applications to \(f\)-divergence inequalities
scientific article; zbMATH DE number 3242951 (Why is no real title available?)
scientific article; zbMATH DE number 3294106 (Why is no real title available?)
Properties of noncommutative Rényi and Augustin information
An upper bound on the cutoff rate of sequential decoding
Optimal sampling of independent increment processes
scientific article; zbMATH DE number 3793923 (Why is no real title available?)

This page was built for publication: Lower bounds to error probability for coding on discrete memoryless channels. I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5657992)