default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHsin-Po Wang 0001
Person information
- affiliation: University of California, Berkeley, CA, USA
- affiliation (2021 - 2022): University of California, San Diego, CA, USA
- affiliation (PhD 2021): University of Illinois at Urbana-Champaign, IL, USA
Other persons with the same name
- Hsin-Po Wang 0002 — SpringSoft, Inc., Hsin Chu, Taiwan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Venkatesan Guruswami, Hsin-Po Wang:
Capacity-Achieving Gray Codes. APPROX/RANDOM 2024: 65:1-65:9- [c10]Hsin-Po Wang, Chi-Wei Chin:
On Counting Subsequences and Higher-Order Fibonacci Numbers. ISIT 2024: 1967-1972 - [c9]Hsin-Po Wang, Venkatesan Guruswami:
Successive Cancellation Sampling Decoder: An Attempt to Analyze List Decoding Theoretically. ISIT 2024: 2412-2417 - [c8]Hsin-Po Wang, Venkatesan Guruswami:
Isolate and then Identify: Rethinking Adaptive Group Testing. ISIT 2024: 3231-3236 - [i22]Hsin-Po Wang, Venkatesan Guruswami:
How Many Matrices Should I Prepare To Polarize Channels Optimally Fast? CoRR abs/2405.16360 (2024) - [i21]Hsin-Po Wang, Ryan Gabrys, Venkatesan Guruswami:
Quickly-Decodable Group Testing with Fewer Tests: Price-Scarlett and Cheraghchi-Nakos's Nonadaptive Splitting with Explicit Scalars. CoRR abs/2405.16370 (2024) - [i20]Hsin-Po Wang, Venkatesan Guruswami:
Successive Cancellation Sampling Decoder: An Attempt to Analyze List Decoding Theoretically. CoRR abs/2405.16373 (2024) - [i19]Hsin-Po Wang, Venkatesan Guruswami:
Isolate and then Identify: Rethinking Adaptive Group Testing. CoRR abs/2405.16374 (2024) - [i18]Hsin-Po Wang, Chi-Wei Chin:
On Counting Subsequences and Higher-Order Fibonacci Numbers. CoRR abs/2405.17499 (2024) - [i17]Venkatesan Guruswami, Hsin-Po Wang:
Capacity-Achieving Gray Codes. CoRR abs/2406.17669 (2024) - [i16]Hsin-Po Wang, Venkatesan Guruswami:
Geno-Weaving: Low-Complexity Capacity-Achieving DNA Storage. CoRR abs/2409.00889 (2024) - 2023
- [j6]Iwan M. Duursma, Hsin-Po Wang
:
Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction. Appl. Algebra Eng. Commun. Comput. 34(4): 717-743 (2023) - [j5]Hsin-Po Wang, Ting-Chun Lin, Alexander Vardy, Ryan Gabrys:
Sub-4.7 Scaling Exponent of Polar Codes. IEEE Trans. Inf. Theory 69(7): 4235-4254 (2023) - [j4]Hsin-Po Wang, Ryan Gabrys, Alexander Vardy:
Tropical Group Testing. IEEE Trans. Inf. Theory 69(9): 6098-6120 (2023) - [c7]Hsin-Po Wang, Chi-Wei Chin:
Density Devolution for Ordering Synthetic Channels. ISIT 2023: 1544-1549 - [c6]Ting-Chun Lin, Hsin-Po Wang:
Optimal Self-Dual Inequalities to Order Polarized BECs. ISIT 2023: 1550-1555 - [c5]Hsin-Po Wang, Venkatesan Guruswami:
How Many Matrices Should I Prepare To Polarize Channels Optimally Fast? ISIT 2023: 1556-1561 - [c4]Hsin-Po Wang, Vlad-Florin Dragoi:
Fast Methods for Ranking Synthetic BECs. ISIT 2023: 1562-1567 - [c3]Hsin-Po Wang, Ryan Gabrys, Venkatesan Guruswami:
Quickly-Decodable Group Testing with Fewer Tests: Price-Scarlett's Nonadaptive Splitting with Explicit Scalars. ISIT 2023: 1609-1614 - [i15]Ting-Chun Lin, Hsin-Po Wang:
Optimal Self-Dual Inequalities to Order Polarized BECs. CoRR abs/2304.07664 (2023) - [i14]Hsin-Po Wang, Chi-Wei Chin:
Density Devolution for Ordering Synthetic Channels. CoRR abs/2304.07667 (2023) - [i13]Hsin-Po Wang, Vlad-Florin Dragoi:
Fast Methods for Ranking Synthetic BECs. CoRR abs/2304.11781 (2023) - [i12]Venkatesan Guruswami, Hsin-Po Wang:
Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding. CoRR abs/2311.08283 (2023) - 2022
- [c2]Iwan M. Duursma, Ryan Gabrys, Venkatesan Guruswami, Ting-Chun Lin, Hsin-Po Wang:
Accelerating Polarization via Alphabet Extension. APPROX/RANDOM 2022: 17:1-17:15 - [c1]Hsin-Po Wang, Ryan Gabrys, Alexander Vardy:
PCR, Tropical Arithmetic, and Group Testing. ISIT 2022: 963-968 - [i11]Hsin-Po Wang, Ting-Chun Lin, Alexander Vardy, Ryan Gabrys:
Sub-4.7 Scaling Exponent of Polar Codes. CoRR abs/2204.11683 (2022) - [i10]Iwan M. Duursma, Ryan Gabrys, Venkatesan Guruswami, Ting-Chun Lin, Hsin-Po Wang:
Accelerating Polarization via Alphabet Extension. CoRR abs/2207.04522 (2022) - 2021
- [j3]Iwan M. Duursma, Xiao Li, Hsin-Po Wang:
Multilinear Algebra for Distributed Storage. SIAM J. Appl. Algebra Geom. 5(3): 552-587 (2021) - [j2]Hsin-Po Wang, Iwan M. Duursma:
Polar Codes' Simplicity, Random Codes' Durability. IEEE Trans. Inf. Theory 67(3): 1478-1508 (2021) - [j1]Hsin-Po Wang, Iwan M. Duursma:
Log-Logarithmic Time Pruned Polar Coding. IEEE Trans. Inf. Theory 67(3): 1509-1521 (2021) - [i9]Hsin-Po Wang:
Complexity and Second Moment of the Mathematical Theory of Communication. CoRR abs/2107.06420 (2021) - 2020
- [i8]Iwan M. Duursma, Xiao Li, Hsin-Po Wang:
Multilinear Algebra for Distributed Storage. CoRR abs/2006.08911 (2020) - [i7]Iwan M. Duursma, Hsin-Po Wang:
Multilinear Algebra for Minimum Storage Regenerating Codes. CoRR abs/2006.16998 (2020) - [i6]Hsin-Po Wang, Iwan M. Duursma:
Parity-Checked Strassen Algorithm. CoRR abs/2011.15082 (2020)
2010 – 2019
- 2019
- [i5]Hsin-Po Wang, Iwan M. Duursma:
Log-logarithmic Time Pruned Polar Coding. CoRR abs/1905.13340 (2019) - [i4]Hsin-Po Wang, Iwan M. Duursma:
Polar Codes' Simplicity, Random Codes' Durability. CoRR abs/1912.08995 (2019) - 2018
- [i3]Hsin-Po Wang, Iwan M. Duursma:
Polar Code Moderate Deviation: Recovering the Scaling Exponent. CoRR abs/1806.02405 (2018) - [i2]Hsin-Po Wang, Iwan M. Duursma:
Log-logarithmic Time Pruned Polar Coding on Binary Erasure Channels. CoRR abs/1812.08106 (2018) - [i1]Hsin-Po Wang, Iwan M. Duursma:
Polar-like Codes and Asymptotic Tradeoff among Block Length, Code Rate, and Error Probability. CoRR abs/1812.08112 (2018)
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-01-09 12:54 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:
