default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicholas B. Chang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c13]Nicholas B. Chang, Joseph C. Liberti
, Mike Gross:
Rate adaptive distributed source coding for wireless applications. ACSSC 2015: 266-270- 2013
- [c12]Marko Kocic, Matthew J. Ferreira, Nicholas B. Chang:
MIMO-OFDM outage channel capacity with practical imperfect CSI. ACSSC 2013: 1919-1923 - [c11]Nicholas B. Chang, Marko Kocic:
Efficiently encodable non-binary generalized LDPC codes. ACSSC 2013: 2079-2083 - [c10]David L. Romero, Nicholas B. Chang, Adam R. Margetts:
Practical non-binary rateless codes for wireless channels. ACSSC 2013: 2084-2088 - 2012
- [c9]Nicholas B. Chang, David L. Romero:
Non-binary coded modulation and iterative detection for high spectral efficiency in MIMO. ACSCC 2012: 458-462 - [c8]David L. Romero, Nicholas B. Chang:
Sequential decoding of non-binary LDPC codes on graphics processing units. ACSCC 2012: 1267-1271 - 2011
- [c7]Nicholas B. Chang:
Rate adaptive non-binary LDPC codes with low encoding complexity. ACSCC 2011: 664-668
2000 – 2009
- 2009
- [j4]Nicholas B. Chang, Mingyan Liu:
Optimal channel probing and transmission scheduling for opportunistic spectrum access. IEEE/ACM Trans. Netw. 17(6): 1805-1818 (2009) - 2008
- [j3]Nicholas B. Chang, Mingyan Liu:
Optimal Competitive Algorithms for Opportunistic Spectrum Access. IEEE J. Sel. Areas Commun. 26(7): 1183-1192 (2008) - [j2]Nicholas B. Chang, Mingyan Liu:
Constrained Sequential Resource Allocation and Guessing Games. IEEE Trans. Inf. Theory 54(11): 4946-4965 (2008) - [c6]Adam R. Margetts, Nicholas B. Chang, Keith W. Forsythe, Daniel W. Bliss:
Iterative inter-symbol interference canceling receiver for direct space-time GF(q) LDPC modulation. ACSCC 2008: 1772-1776 - [c5]Nicholas B. Chang, Mingyan Liu:
Competitive Analysis of Opportunistic Spectrum Access Strategies. INFOCOM 2008: 1535-1542 - 2007
- [b1]Nicholas B. Chang:
Sequential resource allocation in communication networks: Guessing games, strategies, and online algorithms. University of Michigan, USA, 2007 - [j1]Nicholas B. Chang, Mingyan Liu:
Controlled flooding search in a large network. IEEE/ACM Trans. Netw. 15(2): 436-449 (2007) - [c4]Nicholas B. Chang, Mingyan Liu:
Optimal channel probing and transmission scheduling for opportunistic spectrum access. MobiCom 2007: 27-38 - 2006
- [c3]Nicholas B. Chang, Mingyan Liu:
Controlled Flooding Search with Delay Constraints. INFOCOM 2006 - 2005
- [c2]Nicholas B. Chang, Mingyan Liu:
Optimal Controlled Flooding Search in a Large Wireless Network. WiOpt 2005: 229-237 - 2004
- [c1]Nicholas B. Chang, Mingyan Liu:
Revisiting the TTL-based controlled flooding search: optimality and randomization. MobiCom 2004: 85-99
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 2025-03-04 22:29 CET 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:
