default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarol Wang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c14]Amitalok J. Budkuley, Bikash Kumar Dey, Sidharth Jaggi
, Michael Langberg, Anand D. Sarwate, Carol Wang:
Symmetrizability for Myopic AVCs. ISIT 2020: 2103-2107
2010 – 2019
- 2019
- [j5]Mladen Kovacevic, Carol Wang, Vincent Y. F. Tan:
Fundamental Limits of Communication Over State-Dependent Channels With Feedback. IEEE Trans. Commun. 67(5): 3182-3191 (2019) - [j4]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) - [c13]Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, Carol Wang:
The Interplay of Causality and Myopia in Adversarial Channel Models. ISIT 2019: 1002-1006 - 2018
- [c12]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 - [c11]Carol Wang, Mladen Kovacevic, Vincent Y. F. Tan:
Error-Free Communication Over State-Dependent Channels with Variable-Length Feedback. ISIT 2018: 286-290 - 2017
- [j3]Venkatesan Guruswami, Carol Wang:
Deletion Codes in the High-Noise and High-Rate Regimes. IEEE Trans. Inf. Theory 63(4): 1961-1970 (2017) - [c10]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 - [c9]Carol Wang, Mehul Motani:
Coding for the binary energy harvesting channel with finite battery. ITW 2017: 554-558 - [c8]Parikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf, Carol Wang, Sergey Yekhanin:
Maximally Recoverable Codes for Grid-like Topologies. SODA 2017: 2092-2108 - [i11]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) - [i10]Mladen Kovacevic, Carol Wang, Vincent Y. F. Tan:
Error-Free Communication Over State-Dependent Channels with Variable-Length Feedback. CoRR abs/1712.07756 (2017) - 2016
- [j2]Venkatesan Guruswami, Carol Wang, Chaoping Xing:
Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs. IEEE Trans. Inf. Theory 62(5): 2707-2718 (2016) - [c7]Carol Wang:
On the capacity of the binary adversarial wiretap channel. Allerton 2016: 363-369 - [i9]Carol Wang:
The capacity of the binary adversarial wiretap channel. CoRR abs/1605.01330 (2016) - [i8]Parikshit Gopalan, Guangda Hu, Shubhangi Saraf, Carol Wang, Sergey Yekhanin:
Maximally Recoverable Codes for Grid-like Topologies. CoRR abs/1605.05412 (2016) - 2015
- [c6]Venkatesan Guruswami, Carol Wang:
Deletion Codes in the High-noise and High-rate Regimes. APPROX-RANDOM 2015: 867-880 - [c5]Venkatesan Guruswami, Madhu Sudan, Ameya Velingker, Carol Wang:
Limitations on Testable Affine-Invariant Codes in the High-Rate Regime. SODA 2015: 1312-1325 - 2014
- [c4]Venkatesan Guruswami, Carol Wang:
Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes. APPROX-RANDOM 2014: 748-761 - [i7]Venkatesan Guruswami, Carol Wang:
Deletion codes in the high-noise and high-rate regimes. CoRR abs/1411.6667 (2014) - [i6]Venkatesan Guruswami, Madhu Sudan, Ameya Velingker, Carol Wang:
Limitations on Testable Affine-Invariant Codes in the High-Rate Regime. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j1]Venkatesan Guruswami, Carol Wang:
Linear-Algebraic List Decoding for Variants of Reed-Solomon Codes. IEEE Trans. Inf. Theory 59(6): 3257-3268 (2013) - [i5]Venkatesan Guruswami, Carol Wang:
Explicit rank-metric codes list-decodable with optimal redundancy. CoRR abs/1311.7084 (2013) - [i4]Venkatesan Guruswami, Carol Wang:
Explicit rank-metric codes list-decodable with optimal redundancy. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c3]Venkatesan Guruswami, Srivatsan Narayanan, Carol Wang:
List decoding subspace codes from insertions and deletions. ITCS 2012: 183-189 - [i3]Venkatesan Guruswami, Srivatsan Narayanan, Carol Wang:
List decoding subspace codes from insertions and deletions. CoRR abs/1202.0535 (2012) - [i2]Venkatesan Guruswami, Carol Wang:
Linear-algebraic list decoding for variants of Reed-Solomon codes. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c2]Venkatesan Guruswami, Carol Wang:
Optimal Rate List Decoding via Derivative Codes. APPROX-RANDOM 2011: 593-604 - [c1]Douglas Astler, Harrison Chau, Kailin Hsu, Alvin Hua, Andrew Kannan, Lydia Lei, Melissa Nathanson, Esmaeel Paryavi, Michelle Rosen, Hayato Unno, Carol Wang, Khadija Zaidi, Xuemin Zhang, Cha-Min Tang:
Increased accessibility to nonverbal communication through facial and expression recognition technologies for blind/visually impaired subjects. ASSETS 2011: 259-260 - [i1]Venkatesan Guruswami, Carol Wang:
Optimal rate list decoding via derivative codes. CoRR abs/1106.3951 (2011)
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-10-07 21:25 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:
