default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLing-Hua Chang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j5]Ling-Hua Chang, Po-Ning Chen
, Fady Alajaji:
On Decoder Ties for the Binary Symmetric Channel with Arbitrarily Distributed Input. Entropy 25(4): 668 (2023)- [i6]Ling-Hua Chang, Po-Ning Chen, Fady Alajaji:
On Decoder Ties for the Binary Symmetric Channel with Arbitrarily Distributed Input. CoRR abs/2303.08175 (2023) - 2022
- [j4]Ling-Hua Chang, Po-Ning Chen, Fady Alajaji, Yunghsiang S. Han:
Decoder Ties Do Not Affect the Error Exponent of the Memoryless Binary Symmetric Channel. IEEE Trans. Inf. Theory 68(6): 3501-3510 (2022) - 2020
- [c19]Ling-Hua Chang, Po-Ning Chen, Fady Alajaji, Yunghsiang S. Han:
The Asymptotic Generalized Poor-Verdú Bound Achieves the BSC Error Exponent at Zero Rate. ISIT 2020: 2131-2136 - [i5]Ling-Hua Chang, Po-Ning Chen, Fady Alajaji, Yunghsiang S. Han:
The Asymptotic Generalized Poor-Verdu Bound Achieves the BSC Error Exponent at Zero Rate. CoRR abs/2001.01159 (2020) - [i4]Ling-Hua Chang, Po-Ning Chen, Fady Alajaji, Yunghsiang S. Han:
Tightness of the Asymptotic Generalized Poor-Verdú Error Bound for the Memoryless Symmetric Channel. CoRR abs/2007.04080 (2020)
2010 – 2019
- 2019
- [j3]Ling-Hua Chang, Po-Ning Chen, Vincent Y. F. Tan, Carol Wang, Yunghsiang S. Han:
On the Maximum Size of Block Codes Subject to a Distance Criterion. IEEE Trans. Inf. Theory 65(6): 3751-3757 (2019) - [c18]Jwo-Yuh Wu, Liang-Chi Huang, Ming-Hsun Yang, Ling-Hua Chang, Chun-Hung Liu:
Sparse Subspace Clustering With Sequentially Ordered and Weighted L1-Minimization†. ICIP 2019: 3387-3391 - 2018
- [c17]Ling-Hua Chang, Carol Wang, Po-Ning Chen, Vincent Y. F. Tan, Yunghsiang S. Han:
Applications of an exact formula for the largest minimum distance of block codes. CISS 2018: 1 - [c16]Jwo-Yuh Wu, Liang-Chi Huang, Ming-Hsun Yang, Ling-Hua Chang, Chun-Hung Liu:
Enhanced Noisy Sparse Subspace Clustering via Reweighted L1-Minimization†. MLSP 2018: 1-6 - 2017
- [c15]Ling-Hua Chang, Sanjiv Behl:
Efficient tools to implement web-based systems. ICSAI 2017: 1641-1646 - [c14]Pei-Hsin Huang, Ling-Hua Chang, Jwo-Yuh Wu:
Normalized weighted energy detection for spectrum sensing under random primary signal arrival. ISWCS 2017: 13-18 - [c13]Ling-Hua Chang, Carol Wang, Po-Ning Chen, Yunghsiang S. Han, Vincent Y. F. Tan:
Distance spectrum formula for the largest minimum hamming distance of finite-length binary block codes. ITW 2017: 419-423 - [i3]Ling-Hua Chang, Carol Wang, Po-Ning Chen, Vincent Y. F. Tan, Yunghsiang S. Han:
An Exact Spectrum Formula for the Maximum Size of Finite Length Block Codes. CoRR abs/1706.04709 (2017) - 2015
- [c12]Ling-Hua Chang, Sanjiv Behl:
Optimizing of an Object-Oriented File System (OOFS). SEKE 2015: 208-212 - 2014
- [j2]Ling-Hua Chang, Jwo-Yuh Wu:
An Improved RIP-Based Performance Guarantee for Sparse Signal Recovery via Orthogonal Matching Pursuit. IEEE Trans. Inf. Theory 60(9): 5702-5715 (2014) - [c11]Ling-Hua Chang, Jwo-Yuh Wu:
Achievable angles between two compressed sparse vectors under RIP-induced norm/distance constraints. ICNC 2014: 523-528 - [c10]Ling-Hua Chang, Sanjiv Behl, Tung-Ho Shieh:
W-Revised: An amazing tool for creating customized websites. ICSAI 2014: 465-470 - [c9]Ling-Hua Chang, Jwo-Yuh Wu:
An improved RIP-based performance guarantee for sparse signal reconstruction via subspace pursuit. SAM 2014: 405-408 - [c8]Ling-Hua Chang, Jwo-Yuh Wu:
An improved RIP-based performance guarantee for sparse signal recovery via orthogonal matching pursuit. ISCCSP 2014: 28-31 - [c7]Ling-Hua Chang, Jwo-Yuh Wu:
An improved RIP-based performance guarantee for sparse signal reconstruction with noise via orthogonal matching pursuit. ISITA 2014: 70-74 - [i2]Ling-Hua Chang, Jwo-Yuh Wu:
An Improved RIP-Based Performance Guarantee for Sparse Signal Recovery via Orthogonal Matching Pursuit. CoRR abs/1401.0578 (2014) - 2013
- [j1]Ling-Hua Chang, Jwo-Yuh Wu:
Achievable Angles Between Two Compressed Sparse Vectors Under Norm/Distance Constraints Imposed by the Restricted Isometry Property: A Plane Geometry Approach. IEEE Trans. Inf. Theory 59(4): 2059-2081 (2013) - [c6]Ling-Hua Chang, Sanjiv Behl, Tung-Ho Shieh:
Amazing of Using ISG on Implementing a Web-Based System. PDCAT 2013: 44-49 - [c5]Vahid Shah-Mansouri, Suyang Duan, Ling-Hua Chang, Vincent W. S. Wong, Jwo-Yuh Wu:
Compressive sensing based asynchronous random access for wireless networks. WCNC 2013: 884-888 - 2012
- [c4]Ling-Hua Chang, Sanjiv Behl:
An Efficient Information System Generator. ACIIDS (3) 2012: 286-297 - [c3]Jwo-Yuh Wu, Ling-Hua Chang:
Channel-aware distributed best-linear-unbiased estimation with reduced communication overheads. ICC 2012: 392-397 - [c2]Ling-Hua Chang, Jwo-Yuh Wu:
Compressive-domain interference cancellation via orthogonal projection: How small the restricted isometry constant of the effective sensing matrix can be? WCNC 2012: 256-261 - [i1]Ling-Hua Chang, Jwo-Yuh Wu:
Achievable Angles Between two Compressed Sparse Vectors Under Norm/Distance Constraints Imposed by the Restricted Isometry Property: A Plane Geometry Approach. CoRR abs/1202.1144 (2012)
2000 – 2009
- 2005
- [c1]Ling-Hua Chang, Ernst L. Leiss:
Compiler Techniques for Data Driven Languages with Superlinear Speed-up. SEKE 2005: 543-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:49 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:
