10.9k citations
- Centre National de la Recherche ScientifiqueFR476 papers
- Weizmann Institute of ScienceIL439 papers
- Technion – Israel Institute of TechnologyIL423 papers
- Heidelberg UniversityDE407 papers
- University of ManchesterGB399 papers
- Lawrence Berkeley National LaboratoryUS396 papers
- University of CambridgeGB396 papers
- Université Paris CitéFR394 papers
- The Ohio State UniversityUS393 papers
- University of California, Santa CruzUS393 papers
- Rutherford Appleton LaboratoryGB392 papers
- Queen Mary University of LondonGB389 papers
6 papers · 2 filters
Multiple Hypotheses Iterative Decoding of LDPC in the Presence of Strong Phase Noise
Shachar Shayovitz, Dan Raphaeli
Many satellite communication systems operating today employ low cost upconverters or downconverters which create phase noise. This noise can severely limit the information rate of…
Polar write once memory codes
David Burshtein, Alona Strugatski
A coding scheme for write once memory (WOM) using polar codes is presented. It is shown that the scheme achieves the capacity region of noiseless WOMs when an arbitrary number of m…
Space-Time MIMO Multicasting
Idan Livni, Anatoly Khina, Ayal Hitron +1
Multicasting is the general method of conveying the same information to multiple users over a broadcast channel. In this work, the Gaussian MIMO broadcast channel is considered, wi…
A simpler derivation of the coding theorem
Yuval Lomnitz, Meir Feder
A simple proof for the Shannon coding theorem, using only the Markov inequality, is presented. The technique is useful for didactic purposes, since it does not require many prelimi…
On Pseudocodewords and Improved Union Bound of Linear Programming Decoding of HDPC Codes
Ohad Gidon, Yair Be'ery
In this paper, we present an improved union bound on the Linear Programming (LP) decoding performance of the binary linear codes transmitted over an additive white Gaussian noise c…
Universal communication part II: channels with memory
Yuval Lomnitz, Meir Feder
Consider communication over a channel whose probabilistic model is completely unknown vector-wise and is not assumed to be stationary. Communication over such channels is challengi…