Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Kudekar, Shrinivas"'
Consider a binary linear code of length $N$, minimum distance $d_{\text{min}}$, transmission over the binary erasure channel with parameter $0 < \epsilon < 1$ or the binary symmetric channel with parameter $0 < \epsilon < \frac12$, and block-MAP deco
Externí odkaz:
http://arxiv.org/abs/1801.09481
The question whether RM codes are capacity-achieving is a long-standing open problem in coding theory that was recently answered in the affirmative for transmission over erasure channels [1], [2]. Remarkably, the proof does not rely on specific prope
Externí odkaz:
http://arxiv.org/abs/1601.06048
Autor:
Niesen, Urs, Kudekar, Shrinivas
Publikováno v:
IEEE Transactions on Information Theory, vol. 65, pp. 1626 - 1638, March 2019
Decreasing transistor sizes and lower voltage swings cause two distinct problems for communication in integrated circuits. First, decreasing inter-wire spacing increases interline capacitive coupling, which adversely affects transmission energy and d
Externí odkaz:
http://arxiv.org/abs/1601.04961
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
We consider the effect of log-likelihood ratio saturation on belief propagation decoder low-density parity-check codes. Saturation is commonly done in practice and is known to have a significant effect on error floor performance. Our focus is on thre
Externí odkaz:
http://arxiv.org/abs/1412.8090
We consider the effect of LLR saturation on belief propagation decoding of low-density parity-check codes. Saturation occurs universally in practice and is known to have a significant effect on error floor performance. Our focus is on threshold analy
Externí odkaz:
http://arxiv.org/abs/1403.3678
We establish the existence of wave-like solutions to spatially coupled graphical models which, in the large size limit, can be characterized by a one-dimensional real-valued state. This is extended to a proof of the threshold saturation phenomenon fo
Externí odkaz:
http://arxiv.org/abs/1208.5273
We investigate spatially coupled code ensembles. For transmission over the binary erasure channel, it was recently shown that spatial coupling increases the belief propagation threshold of the ensemble to essentially the maximum a-priori threshold of
Externí odkaz:
http://arxiv.org/abs/1201.2999
We consider transmission over a binary-input additive white Gaussian noise channel using low-density parity-check codes. One of the most popular techniques for decoding low-density parity-check codes is the linear programming decoder. In general, the
Externí odkaz:
http://arxiv.org/abs/1105.4665