18 citations · 63 across the 13 of their papers we have counts for
15 papers
Matrix Representations of Finite Fields
Tzu-Wei Lin, Bo-Jiun Lee, Hsin-Po Wang
Finite fields are important algebraic structures that have a wide range of applications in fields such as coding theory and cryptography. But the standard construction of finite fi…
How Many Matrices Should I Prepare To Polarize Channels Optimally Fast?
Hsin-Po Wang, Venkatesan Guruswami
Polar codes that approach capacity at a near-optimal speed, namely with scaling exponents close to , have been shown possible for -ary erasure channels (Pfister and Urbanke),…
Density Devolution for Ordering Synthetic Channels
Hsin-Po Wang, Chi-Wei Chin
Constructing a polar code is all about selecting a subset of rows from a Kronecker power of . It is known that, under successive cancellation decoder, some rows are P…
Optimal Self-Dual Inequalities to Order Polarized BECs
Ting-Chun Lin, Hsin-Po Wang
is proved for all and all . This confirms a conjecture about polar code, made by Wu and Siegel in 2019, that $W^{0…
Accelerating Polarization via Alphabet Extension
Iwan Duursma, Ryan Gabrys, Venkatesan Guruswami +2
Polarization is an unprecedented coding technique in that it not only achieves channel capacity, but also does so at a faster speed of convergence than any other coding technique.…
Sub-4.7 Scaling Exponent of Polar Codes
Hsin-Po Wang, Ting-Chun Lin, Alexander Vardy +1
Polar code visibly approaches channel capacity in practice and is thereby a constituent code of the 5G standard. Compared to low-density parity-check code, however, the performance…
Tropical Group Testing
Hsin-Po Wang, Ryan Gabrys, Alexander Vardy
Polymerase chain reaction (PCR) testing is the gold standard for diagnosing COVID-19. PCR amplifies the virus DNA 40 times to produce measurements of viral loads that span seven or…
Parity-Checked Strassen Algorithm
Hsin-Po Wang, Iwan Duursma
To multiply astronomic matrices using parallel workers subject to straggling, we recommend interleaving checksums with some fast matrix multiplication algorithms. Nesting the parit…
Multilinear Algebra for Minimum Storage Regenerating Codes
Iwan Duursma, Hsin-Po Wang
An -MSR (minimum storage regeneration) code is a set of nodes used to store a file. For a file of total size , each node stores symbols, any nodes rec…
Multilinear Algebra for Distributed Storage
Iwan Duursma, Xiao Li, Hsin-Po Wang
An -ERRC (exact-repair regenerating code) is a collection of nodes used to store a file. For a file of total size , each node stores symbols, any …
Polar Codes' Simplicity, Random Codes' Durability
Hsin-Po Wang, Iwan Duursma
Over any discrete memoryless channel, we build codes such that: for one, their block error probabilities and code rates scale like random codes'; and for two, their encoding and de…
Log-logarithmic Time Pruned Polar Coding
Hsin-Po Wang, Iwan Duursma
A pruned variant of polar coding is proposed for binary erasure channels. For sufficiently small , we construct a series of capacity achieving codes with block lengt…
Polar-like Codes and Asymptotic Tradeoff among Block Length, Code Rate, and Error Probability
Hsin-Po Wang, Iwan Duursma
A general framework is proposed that includes polar codes over arbitrary channels with arbitrary kernels. The asymptotic tradeoff among block length , code rate , and error p…
Log-logarithmic Time Pruned Polar Coding on Binary Erasure Channels
Hsin-Po Wang, Iwan Duursma
A pruned variant of polar coding is reinvented for all binary erasure channels. For small , we construct codes with block length , code rate $\text…
Polar Code Moderate Deviation: Recovering the Scaling Exponent
Hsin-Po Wang, Iwan Duursma
In 2008 Arikan proposed polar coding [arXiv:0807.3917] which we summarize as follows: (a) From the root channel synthesize recursively a series of channels $W_N^{(1)},\dotsc,W_…