default search action
Hung-Peng Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c3]Pei-Jun Lee
, Hung-Peng Lee, En-Pei Wu:
Hardware aware fast depth map generation algorithm. ICCE-Berlin 2017: 62-64 - 2014
- [j11]Shao-I Chu, Hung-Peng Lee, Hsin-Chiu Chang, Wei-Cheng Lin:
On the performance of amplify-and-forward protocol with generalised order selection combining. Trans. Emerg. Telecommun. Technol. 25(4): 461-467 (2014) - 2013
- [j10]Hung-Peng Lee, Shao-I Chu, Hsin-Chiu Chang:
Efficient decoding of the (23, 12, 7) Golay code up to five errors. Inf. Sci. 253: 170-178 (2013) - [j9]Shao-I Chu, Wei-Cheng Lin, Hung-Peng Lee, Hsin-Chiu Chang:
Performance analysis and power allocation for decode-and-forward cooperative communications over Rician fading channel. Wirel. Commun. Mob. Comput. 13(16): 1464-1481 (2013) - 2012
- [j8]Shao-I Chu, Hsin-Chiu Chang, Hung-Peng Lee:
Asymptotic performance of amplify-and-forward cooperative diversity networks with the Nth best relay over Rician fading channels. Trans. Emerg. Telecommun. Technol. 23(4): 327-333 (2012) - [j7]Hung-Peng Lee, Hsin-Chiu Chang, Trieu-Kien Truong:
Algebraic decoding of the (73, 37, 13) quadratic residue code. IET Commun. 6(10): 1326-1333 (2012) - [j6]Tsung-Ching Lin, Hung-Peng Lee, Hsin-Chiu Chang, Trieu-Kien Truong:
A cyclic weight algorithm of decoding the (47, 24, 11) quadratic residue code. Inf. Sci. 197: 215-222 (2012) - 2011
- [j5]Shao-I Chu, Hung-Peng Lee, Hsin-Chiu Chang:
Fast decoding of the (23, 12, 7) Golay code with four-error-correcting capability. Eur. Trans. Telecommun. 22(7): 388-395 (2011) - [j4]Tsung-Ching Lin, Trieu-Kien Truong, Hsin-Chiu Chang, Hung-Peng Lee:
A Future Simplification of Procedure for Decoding Nonsystematic Reed-Solomon Codes Using the Berlekamp-Massey Algorithm. IEEE Trans. Commun. 59(6): 1555-1562 (2011) - 2010
- [j3]Tsung-Ching Lin, Hung-Peng Lee, Hsin-Chiu Chang, Shao-I Chu, Trieu-Kien Truong:
High speed decoding of the binary (47, 24, 11) quadratic residue code. Inf. Sci. 180(20): 4060-4068 (2010) - [j2]Tsung-Ching Lin, Hsin-Chiu Chang, Hung-Peng Lee, Trieu-Kien Truong:
On the decoding of the (24, 12, 8) Golay code. Inf. Sci. 180(23): 4729-4736 (2010)
2000 – 2009
- 2009
- [j1]Tsung-Ching Lin, Trieu-Kien Truong, Hung-Peng Lee, Hsin-Chiu Chang:
Algebraic decoding of the (41, 21, 9) Quadratic Residue code. Inf. Sci. 179(19): 3451-3459 (2009) - [c2]Hung-Peng Lee, Kunta Hsiesh:
Fast Algorithm for Decoding the Binary (23, 12, 7) Quadratic Residue Code. IIH-MSP 2009: 599-603 - 2008
- [c1]Hung-Peng Lee, Hsin-Chiu Chang, Tsung-Ching Lin, Trieu-Kien Truong:
A Weight Method of Decoding the Binary BCH Code. ISDA (3) 2008: 545-549
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: