Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Şaşoğlu, Eren"'
Collecting large quantities of high-quality data can be prohibitively expensive or impractical, and a bottleneck in machine learning. One may instead augment a small set of $n$ data points from the target distribution with data from more accessible s
Externí odkaz:
http://arxiv.org/abs/2402.04376
A low-complexity coding scheme is developed to achieve the rate region of maximum likelihood decoding for interference channels. As in the classical rate-splitting multiple access scheme by Grant, Rimoldi, Urbanke, and Whiting, the proposed coding sc
Externí odkaz:
http://arxiv.org/abs/1701.02345
Autor:
Sasoglu, Eren, Tal, Ido
We study polar coding for stochastic processes with memory. For example, a process may be defined by the joint distribution of the input and output of a channel. The memory may be present in the channel, the input, or both. We show that $\psi$-mixing
Externí odkaz:
http://arxiv.org/abs/1602.01870
Autor:
Kudekar, Shrinivas, Kumar, Santhosh, Mondelli, Marco, Pfister, Henry D., Şaşoğlu, Eren, Urbanke, Rüdiger
We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes our method exploits code symme
Externí odkaz:
http://arxiv.org/abs/1601.04689
We show that Reed-Muller codes achieve capacity under maximum a posteriori bit decoding for transmission over the binary erasure channel for all rates $0 < R < 1$. The proof is generic and applies to other codes with sufficient amount of symmetry as
Externí odkaz:
http://arxiv.org/abs/1505.05831
Humans have $23$ pairs of homologous chromosomes. The homologous pairs are almost identical pairs of chromosomes. For the most part, differences in homologous chromosome occur at certain documented positions called single nucleotide polymorphisms (SN
Externí odkaz:
http://arxiv.org/abs/1502.01975
Autor:
Wang, Lele, Sasoglu, Eren
A polar coding scheme for interference networks is introduced. The scheme combines Arikan's monotone chain rules for multiple-access channels and a method by Hassani and Urbanke to 'align' two incompatible polarization processes. It achieves the Han-
Externí odkaz:
http://arxiv.org/abs/1401.7293
Autor:
Sasoglu, Eren, Wang, Lele
A method to polarize channels universally is introduced. The method is based on combining two distinct channels in each polarization step, as opposed to Arikan's original method of combining identical channels. This creates an equal number of only tw
Externí odkaz:
http://arxiv.org/abs/1307.7495
A new inner bound on the capacity region of a general index coding problem is established. Unlike most existing bounds that are based on graph theoretic or algebraic tools, the bound is built on a random coding scheme and optimal decoding, and has a
Externí odkaz:
http://arxiv.org/abs/1302.1601
There are two variants of superposition coding schemes. Cover's original superposition coding scheme has code clouds of the identical shape, while Bergmans's superposition coding scheme has code clouds of independently generated shapes. These two sch
Externí odkaz:
http://arxiv.org/abs/1302.1258