Publication

Capacity upper bounds for the deletion channel

Related publications (33)

About
Privacy
Disclaimer

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Capacity upper bounds for the deletion channel

Graph Chatbot

Chat with Graph Search

Fine-Tunning a MAP Error Corrections Algorithm for Five-Key Chording Keyboards

The Stationary Behaviour of Fluid Limits of Reversible Processes is Concentrated on Stationary Points

Accurate and efficient evaluation of failure probability for partial different equations with random input data

Method and apparatus for multiple object tracking with k-shortest paths

A bottom-up stochastic model to predict building occupants' time-dependent activities

Tight Bounds on the Redundancy of Huffman Codes

Expected loss bounds for authentication in constrained channels

Cavity Optomechanics: Cooling of a Micromechanical Oscillator into the Quantum Regime

Expectations as Endowments: Evidence on Reference-Dependent Preferences from Exchange and Valuation Experiments

The Stationary Behaviour of Fluid Limits of Reversible Processes is Concentrated on Stationary Points

Accurate and efficient evaluation of failure probability for partial different equations with random input data

Fine-Tunning a MAP Error Corrections Algorithm for Five-Key Chording Keyboards

A bottom-up stochastic model to predict building occupants' time-dependent activities

The Stationary Behaviour of Fluid Limits of Reversible Processes is Concentrated on Stationary Points

The Stationary Behaviour of Fluid Limits of Reversible Processes is Concentrated on Stationary Points

Method and apparatus for multiple object tracking with k-shortest paths

Tight Bounds on the Redundancy of Huffman Codes

Expected loss bounds for authentication in constrained channels

Cavity Optomechanics: Cooling of a Micromechanical Oscillator into the Quantum Regime

Expectations as Endowments: Evidence on Reference-Dependent Preferences from Exchange and Valuation Experiments