Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Fazeli, Arman"'
In this work, we present a deterministic algorithm for computing the entire weight distribution of polar codes. As the first step, we derive an efficient recursive procedure to compute the weight distribution that arises in successive cancellation de
Externí odkaz:
http://arxiv.org/abs/2102.07362
Autor:
Hashemi, Seyyed Ali, Mondelli, Marco, Fazeli, Arman, Vardy, Alexander, Cioffi, John, Goldsmith, Andrea
This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the number of processing elements $P$ that can perform SSC decoding operatio
Externí odkaz:
http://arxiv.org/abs/2012.13378
Polar coding gives rise to the first explicit family of codes that provably achieve capacity with efficient encoding and decoding for a wide range of channels. However, its performance at short block lengths is far from optimal. Arikan has recently p
Externí odkaz:
http://arxiv.org/abs/2005.13711
This paper presents the first proof of polarization for the deletion channel with a constant deletion rate and a regular hidden-Markov input distribution. A key part of this work involves representing the deletion channel using a trellis and describi
Externí odkaz:
http://arxiv.org/abs/1904.13385
Herein, we focus on explicit constructions of $\ell\times\ell$ binary kernels with small scaling exponent for $\ell \le 64$. In particular, we exhibit a sequence of binary linear codes that approaches capacity on the BEC with quasi-linear complexity
Externí odkaz:
http://arxiv.org/abs/1901.08186
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We prove that, for the binary erasure channel (BEC), the polar-coding paradigm gives rise to codes that not only approach the Shannon limit but do so under the best possible scaling of their block length as a~function of the gap to capacity. This res
Externí odkaz:
http://arxiv.org/abs/1711.01339
Regenerating codes for distributed storage have attracted much research interest in the past decade. Such codes trade the bandwidth needed to repair a failed node with the overall amount of data stored in the network. Minimum storage regenerating (MS
Externí odkaz:
http://arxiv.org/abs/1602.04496
Private information retrieval (PIR) protocols allow a user to retrieve a data item from a database without revealing any information about the identity of the item being retrieved. Specifically, in information-theoretic $k$-server PIR, the database i
Externí odkaz:
http://arxiv.org/abs/1505.06241
Kulkarni and Kiyavash recently introduced a new method to establish upper bounds on the size of deletion-correcting codes. This method is based upon tools from hypergraph theory. The deletion channel is represented by a hypergraph whose edges are the
Externí odkaz:
http://arxiv.org/abs/1401.6496