539 citations
- Hewlett-Packard (United Kingdom)GB7 papers
- Bristol Laboratories (United Kingdom)GB6 papers
- Loughborough UniversityGB4 papers
- Stanford UniversityUS4 papers
- MIT-Harvard Center for Ultracold AtomsUS3 papers
- The University of QueenslandAU3 papers
- University of California, BerkeleyUS3 papers
- University of CambridgeGB3 papers
- Centre for Quantum Computation and Communication TechnologyAU2 papers
- Cornell UniversityUS2 papers
- Harvard University PressUS2 papers
- Intel (United States)US2 papers
7 papers · 1 filter
LP Decoding meets LP Decoding: A Connection between Channel Coding and Compressed Sensing
Alexandros G. Dimakis, Pascal O. Vontobel
This is a tale of two linear programming decoders, namely channel coding linear programming decoding (CC-LPD) and compressed sensing linear programming decoding (CS-LPD). So far, t…
A Subsequence-Histogram Method for Generic Vocabulary Recognition over Deletion Channels
Majid Fozunbal
We consider the problem of recognizing a vocabulary--a collection of words (sequences) over a finite alphabet--from a potential subsequence of one of its words. We assume the given…
On the Degrees-of-Freedom of the K-User Gaussian Interference Channel
Raul Etkin, Erik Ordentlich
The degrees-of-freedom of a K-user Gaussian interference channel (GIFC) has been defined to be the multiple of (1/2)log_2(P) at which the maximum sum of achievable rates grows with…
Error Exponents of Optimum Decoding for the Interference Channel
Raul Etkin, Neri Merhav, Erik Ordentlich
Exponential error bounds for the finite-alphabet interference channel (IFC) with two transmitter-receiver pairs, are investigated under the random coding regime. Our focus is on op…
List Decoding of Burst Errors
Ron M. Roth, Pascal O. Vontobel
A generalization of the Reiger bound is presented for the list decoding of burst errors. It is then shown that Reed-Solomon codes attain this bound.
Interior-Point Algorithms for Linear-Programming Decoding
Pascal O. Vontobel
Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this paper we study efficient implementations of such algori…