default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShih-Chun Chang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j13]Kuo-Wei Liao, Nhat-Duc Hoang, Shih-Chun Chang:
Estimating landslide occurrence via small watershed method with relevance vector machine. Earth Sci. Informatics 13(2): 249-260 (2020)
2010 – 2019
- 2015
- [j12]Wook Jung, Shih-Chun Chang:
Integer programming approach to unequal error protection coding for multiuser broadcast channels. IET Commun. 9(9): 1164-1173 (2015) - 2014
- [i1]Wook Jung, Shih-Chun Chang:
An Integer Programming Approach to UEP Coding for Multiuser Broadcast Channels. CoRR abs/1401.5321 (2014) - 2011
- [c6]Wai H. Fong, Qin Huang, Shih-Chun Chang, Shu Lin:
Multiple Phased-Burst Correcting Superposition Product LDPC Codes. ICC 2011: 1-5 - 2010
- [j11]Ying-Wah Wu, Shih-Chun Chang:
Coding schemes for noiseless and noisy asynchronous CDMA systems. IEEE Trans. Inf. Theory 56(8): 3786-3792 (2010) - [c5]Rich Echard, Shih-Chun Chang:
Good high-rate pi-rotation LDPC codes based on novel puncturing techniques. ISITA 2010: 1-6
2000 – 2009
- 2007
- [j10]Rich Echard, Shih-Chun Chang:
Geometric Interpretation and Design Strategy for π-Rotation LDPC Codes. IEEE Commun. Lett. 11(9): 750-751 (2007) - 2005
- [j9]Rich Echard, Shih-Chun Chang:
Design considerations leading to the development of good π-rotation LDPC codes. IEEE Commun. Lett. 9(5): 447-449 (2005) - 2003
- [j8]Rich Echard, Shih-Chun Chang:
The extended irregular π-rotation LDPC codes. IEEE Commun. Lett. 7(5): 230-232 (2003) - 2002
- [c4]Rich Echard, Shih-Chun Chang:
Irregular π-rotation LDPC codes. GLOBECOM 2002: 1274-1278 - [c3]Hatim M. Behairy, Shih-Chun Chang:
On the design, simulation and analysis of parallel concatenated Gallager codes. ICC 2002: 1850-1854 - 2001
- [c2]Rich Echard, Shih-Chun Chang:
The π-rotation low-density parity check codes. GLOBECOM 2001: 980-984 - [c1]Hatim M. Behairy, Shih-Chun Chang:
Parallel concatenated Gallager codes for CDMA applications. GLOBECOM 2001: 1002-1006
1990 – 1999
- 1997
- [j7]Ying-Wah Wu, Shih-Chun Chang:
Coding scheme for synchronous-CDMA systems. IEEE Trans. Inf. Theory 43(3): 1064-1067 (1997) - 1991
- [j6]Shih-Chun Chang:
Review of 'Essentials of Error-Control Coding Techniques' (Imai, H.; 1990). IEEE Trans. Inf. Theory 37(4): 1234- (1991)
1980 – 1989
- 1984
- [j5]Shih-Chun Chang:
Further results on coding for T-user multiple-access channels. IEEE Trans. Inf. Theory 30(2): 411-415 (1984) - 1981
- [j4]Shih-Chun Chang, Jack K. Wolf:
On the T-user M-frequency noiseless multiple-access channel with and without intensity information. IEEE Trans. Inf. Theory 27(1): 41-48 (1981) - 1980
- [j3]Shih-Chun Chang, Jack K. Wolf:
A simple derivation of the MacWilliams' identity for linear codes (Corresp.). IEEE Trans. Inf. Theory 26(4): 476-477 (1980)
1970 – 1979
- 1979
- [j2]Shih-Chun Chang:
Coding for a T-User Multiple-Access Channel (Ph.D. Thesis abstr.). IEEE Trans. Inf. Theory 25(2): 257 (1979) - [j1]Shih-Chun Chang, Edward J. Weldon Jr.:
Coding for T-user multiple-access channels. IEEE Trans. Inf. Theory 25(6): 684-691 (1979)
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-24 22:59 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:
