Concept

Binary symmetric channel

Related publications (176)

Transmission of Images over Noisy Channels Using Error-resilient Wavelet Coding and Forward Error Correction

A novel embedded wavelet coding scheme is proposed for the transmission of images over unreliable channels. The proposed scheme is based on the partitioning of information into a number of layers which can be decoded independently provided that some import ...

Institute of Electrical and Electronics Engineers2003

Low-delay low-complexity error-correcting codes on sparse graphs

Xiao-Yu Hu

This dissertation presents a systematic exposition on finite-block-length coding theory and practice. We begin with the task of identifying the maximum achievable rates over noisy, finite-block-length constrained channels, referred to as (ε, n)-capacity Cε ...

EPFL2003

Noisy Text Categorization

Alessandro Vinciarelli

This work presents a system for the categorization of noisy texts. By noisy it is meant any text obtained through an extraction process (affected by errors) from media different than digital texts. We show that, even with an average Word Error Rate of arou ...

IDIAP2003

Information Retrieval on Noisy Text

Hervé Bourlard, David Grangier, Alessandro Vinciarelli

Spoken Document Retrieval (SDR) consists in retrieving segments of a speech database that are relevant to a query. The state-of-the-art approach to the SDR problem consists in transcribing the speech data into digital text before applying common Informatio ...

IDIAP2003

A feedback strategy for binary symmetric channels

Emre Telatar, Aslan Tchamkerten

Communication over unknown binary symmetric channels with instantaneous and perfect feedback is considered. We describe a universal scheme based on a decision feedback strategy. ...

2002

A feedback strategy for binary symmetric channels

Emre Telatar, Aslan Tchamkerten

Communication over unknown binary symmetric channels with instantaneous and perfect feedback is considered. We describe a universal scheme based on a decision feedback strategy. ...

2002

Finite-length analysis of various low-density parity-check ensembles for the binary erasure channel

Rüdiger Urbanke, Mohammad Amin Shokrollahi

We investigate the average erasure probability of the belief propagation algorithm over the binary erasure channel (BEC) for various finite-length low- density parity-check (LDPC) ensembles. In particular, we give tight upper bounds on the "error floor", i ...

2002

Potential of chaos communication over noisy channels - Channel coding using chaotic piecewise linear maps

Martin Hasler, Thomas Schimming

The paper gives an information theoretic analysis of the potential of chaos in digital communication schemes, underlining that there is no fundamental principle that speaks against the use of chaotic systems in digital communications. The channel model con ...

2002

Optimal and suboptimal chaos receivers

Martin Hasler, Thomas Schimming

The paper describes the state of the art in the design of receivers for chaos based digital communication over noisy channels. In the first part, an information theoretic analysis of the potential of chaos in digital communication schemes is given, underli ...

2002

Ergodic chaos shift keying for 2 users

Martin Hasler, Thomas Schimming

We show how a multiuser chaos-based communication system can be designed. The approach builds on the recently introduced method of ergodic chaos shift keying. This method uses a nonlinear correlation estimator for extracting the binary information from the ...

2001

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.