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

(69)

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

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)