Pages that link to "Item:Q5657992"

The following pages link to Lower bounds to error probability for coding on discrete memoryless channels. I (Q5657992):

Displaying 38 items.

• On the BSC reliability function: expanding the region where it is known exactly (Q327296) (← links)
• Entanglement can increase asymptotic rates of zero-error classical communication over classical channels (Q411372) (← links)
• Code spectrum and the reliability function: binary symmetric channel (Q415682) (← links)
• On the reliability function for a BSC with noisy feedback (Q415711) (← links)
• Error exponents for two-hop Gaussian multiple source-destination relay channels (Q439735) (← links)
• The exponent of error probability in various modulation and coding systems (Q584224) (← links)
• List decodability at small radii (Q717148) (← links)
• Second-order converses via reverse hypercontractivity (Q778887) (← links)
• Lower bound for error probability in a discrete memoryless channel with feedback (Q788694) (← links)
• An upper bound on error probability in communication systems with single-user reception based on order statistics (Q827893) (← links)
• Code spectrum and the reliability function: Gaussian channel (Q926623) (← links)
• Random-coding bounds for some broadcast channels (Q1057834) (← links)
• Coding in a channel with generalized defects and random errors (Q1065752) (← links)
• Decentralized detection by a large number of sensors (Q1111520) (← links)
• A coding theorem for multiple access channels using a maximum likelihood list decoding scheme (Q1141117) (← links)
• Lower bound for ensemble-average error probability for a discrete memoryless channel (Q1148859) (← links)
• Lower bounds for the cardinality of error-correcting codes in channels with multiple access (Q1151867) (← links)
• Random coding bounds for discrete memoryless channels (Q1168948) (← links)
• Properties of noncommutative Rényi and Augustin information (Q2113490) (← links)
• Rate optimal Chernoff bound and application to community detection in the stochastic block models (Q2180063) (← links)
• The sphere packing bound for memoryless channels (Q2211175) (← links)
• Erratum to: ``Bounds on the rate of disjunctive codes'' (Q2364468) (← links)
• Sharpening of an upper bound for the reliability function of a binary symmetric channel (Q2432956) (← links)
• Diagnostische Vorgabeexperimente mit stochastischen Automaten. (Diagnosing preset experiments with stochastic automata) (Q2548950) (← links)
• Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vlăduţ-Zink bounds (Q2705935) (← links)
• Random coding bound for \(E\)-capacity of DMC with stochastic encoding (Q2907832) (← links)
• Optimal sampling of independent increment processes (Q3051271) (← links)
• The Minimum Average Code for Finite Memoryless Monotone Sources (Q3548216) (← links)
• A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels (Q3549021) (← links)
• Chernoff bounds for discriminating between two markov processes (Q4195807) (← links)
• A simple derivation of the refined sphere packing bound under certain symmetry hypotheses (Q4970859) (← links)
• A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels (Q5346239) (← links)
• Obituary: Claude Elwood Shannon 1916-2001 (Q5409124) (← links)
• Error estimates for low rate codes (Q5604959) (← links)
• The strong converse theorem in the decoding scheme of list size $L$ (Q5612991) (← links)
• (Q5672802) (← links)
• Reed-Muller Codes (Q5870775) (← links)
• Quantum \(f\)-divergences via Nussbaum-Szkoła distributions and applications to \(f\)-divergence inequalities (Q6632525) (← links)