Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Ying-Yu Tai"'
Cross-strait mutual fund raising process analysis and Taiwan asset management industry opportunities
Autor:
Ying-Yu Tai, 戴瑛佑
102
The local asset management industry in Taiwan who at this stage into "go not out" and the "long small" of dilemma, Taiwan 38 local asset management industry who by release of Fund, and customer almost all are from Taiwan, but Taiwan onshore
The local asset management industry in Taiwan who at this stage into "go not out" and the "long small" of dilemma, Taiwan 38 local asset management industry who by release of Fund, and customer almost all are from Taiwan, but Taiwan onshore
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/69353979185943314005
Publikováno v:
IEEE Transactions on Information Theory. 59:7898-7914
Many known constructions of LDPC codes can be placed in a general framework using the notion of partial geometries. Based on this notion, the structure of such LDPC codes can be analyzed using a geometric approach that illuminates important propertie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d656acdb775b140f1bc8f98edf136d64
https://doi.org/10.1109/tit.2013.2280640
https://doi.org/10.1109/tit.2013.2280640
Publikováno v:
IEEE Transactions on Communications. 56:545-554
This paper is concerned with construction of efficiently encodable nonbinary quasi-cyclic LDPC codes based on finite fields. Four classes of nonbinary quasi-cyclic LDPC codes are constructed. Experimental results show that codes constructed perform w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::74ff08f61da053e36d8d1b4806f6fe7a
https://doi.org/10.1109/tcomm.2008.060024
https://doi.org/10.1109/tcomm.2008.060024
Publikováno v:
IEEE Transactions on Communications. 56:378-387
This paper presents five methods for constructing nonbinary LDPC codes based on finite geometries. These methods result in five classes of nonbinary LDPC codes, one class of cyclic LDPC codes, three classes of quasi-cyclic LDPC codes and one class of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4cd5141c00e8ef72fe40d8d31d3b17bc
https://doi.org/10.1109/tcomm.2008.060025
https://doi.org/10.1109/tcomm.2008.060025
Publikováno v:
IEEE Transactions on Communications. 56:39-48
This paper presents new methods for efficiently constructing encodable quasi-cyclic low-density parity-check (LDPC) codes based on special balanced incomplete block designs (BIBDs). Codes constructed perform well over both the additive white Gaussian
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4685de4488f9ed61536b246d162e19ee
https://doi.org/10.1109/tcomm.2008.050483
https://doi.org/10.1109/tcomm.2008.050483
Publikováno v:
IEEE Transactions on Communications. 54:1765-1774
This paper is concerned with construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes for three different types of channels: the additive white Gaussian noise, the binary random erasure, and the binary burst erasure channels. Two algeb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bed101887f402725eec91eef171fa1d7
https://doi.org/10.1109/tcomm.2006.881361
https://doi.org/10.1109/tcomm.2006.881361
Publikováno v:
ISIT
It is shown that Euclidean geometry LDPC codes in conjunction with their shortened codes obtained by puncturing their parity-check matrices are effective in correcting combinations of errors and erasures with a two-phase decoding scheme. This is due
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc713d7f9d436ea60dd54d3826deb0a3
https://doi.org/10.1109/isit.2013.6620514
https://doi.org/10.1109/isit.2013.6620514
Publikováno v:
ITA
The trapping set structure of LDPC codes constructed based on finite geometries, called finite geometry (FG) LDPC codes, is analyzed using a geometric approach. In this approach, trapping sets in the Tanner graph of an FG-LDPC code are represented by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a9bbdad5ac81ee6420bfac166b52ac5c
https://doi.org/10.1109/ita.2013.6502922
https://doi.org/10.1109/ita.2013.6502922
Publikováno v:
ISIT
The trapping set structure of LDPC codes constructed using finite geometries is analyzed. A trapping set is modeled as a sub-geometry of the geometry used to construct an LDPC code. The variable nodes of a trapping set are viewed as points of the geo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05cd1f3bf9a9fdb0f0160912166273ff
https://doi.org/10.1109/isit.2012.6284130
https://doi.org/10.1109/isit.2012.6284130
Publikováno v:
2008 Information Theory and Applications Workshop.
This paper investigates the potential of non-binary LDPC codes to replace widely used Reed-Solomon (RS) codes for applications in communication and storage systems for combating mixed types of noise and interferences. The investigation begins with pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e788b58b78907f9876dad53418bdf0e
https://doi.org/10.1109/ita.2008.4601044
https://doi.org/10.1109/ita.2008.4601044