Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Phong, S."'
Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) were recently shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular perfor
Externí odkaz:
http://arxiv.org/abs/1309.7910
Convolutional low-density parity-check (LDPC) codes (or spatially-coupled codes) have now been shown to achieve capacity on binary-input memoryless symmetric channels. The principle behind this surprising result is the threshold-saturation phenomenon
Externí odkaz:
http://arxiv.org/abs/1208.4080
Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) have been shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular performanc
Externí odkaz:
http://arxiv.org/abs/1204.5703
We consider transmission of two independent and separately encoded sources over a two-user binary-input Gaussian multiple-access channel. The channel gains are assumed to be unknown at the transmitter and the goal is to design an encoder-decoder pair
Externí odkaz:
http://arxiv.org/abs/1110.0252
Recently, it has been observed that terminated low-density-parity-check (LDPC) convolutional codes (or spatially-coupled codes) appear to approach capacity universally across the class of binary memoryless channels. This is facilitated by the "thresh
Externí odkaz:
http://arxiv.org/abs/1107.3253
Publikováno v:
IEEE Trans. on Information Theory, vol 57, issue 2 (2011), pages 668 - 691
One popular approach to soft-decision decoding of Reed-Solomon (RS) codes is based on using multiple trials of a simple RS decoding algorithm in combination with erasing or flipping a set of symbols or bits in each trial. This paper presents a framew
Externí odkaz:
http://arxiv.org/abs/1005.4461
Algorithms based on multiple decoding attempts of Reed-Solomon (RS) codes have recently attracted new attention. Choosing decoding candidates based on rate-distortion (R-D) theory, as proposed previously by the authors, currently provides the best pe
Externí odkaz:
http://arxiv.org/abs/1002.0043
Recently, a number of authors have proposed decoding schemes for Reed-Solomon (RS) codes based on multiple trials of a simple RS decoding algorithm. In this paper, we present a rate-distortion (R-D) approach to analyze these multiple-decoding algorit
Externí odkaz:
http://arxiv.org/abs/0908.2828
Publikováno v:
Avian Diseases, 2003 Jan 01. 47(1), 154-162.
Externí odkaz:
https://www.jstor.org/stable/1593217
Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) were recently shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular perfor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a9ed6d161c57f5874127d3ea00b4c602
http://arxiv.org/abs/1309.7910
http://arxiv.org/abs/1309.7910