activity
20122023
most citedAchievable Angles Between two Compressed Sparse Vectors Under Norm/Distance Constraints Imposed by the Restricted Isometry Property: A Plane Geometry Approach

16 citations · 18 across the 7 of their papers we have counts for

collaborators

7 papers

cs.IT2023

On Decoder Ties for the Binary Symmetric Channel with Arbitrarily Distributed Input

Ling-Hua Chang, Po-Ning Chen, Fady Alajaji

The error probability of block codes sent under a non-uniform input distribution over the memoryless binary symmetric channel (BSC) and decoded via the maximum a posteriori (MAP) d…

cond-mat.supr-con2021★ 1 cited

Phonon-Mediated Superconductivity near the Lattice Instability in Hole-doped Hydrogenated Monolayer Hexagonal Boron Nitride

Takat B. Rawal, Ling-Hua Chang, Hao-Dong Liu +2

Employing the density-functional theory with local density approximation, we show that the fully hydrogenated monolayer-hexagonal boron nitride (HBN) has a direct-band gap of 2…

cs.IT2020

Decoder Ties Do Not Affect the Error Exponent of the Memoryless Binary Symmetric Channel

Ling-Hua Chang, Po-Ning Chen, Fady Alajaji +1

The generalized Poor-Verdu error lower bound established in [1] for multihypothesis testing is studied in the classical channel coding context. It is proved that for any sequence o…

cs.IT2020

The Asymptotic Generalized Poor-Verdu Bound Achieves the BSC Error Exponent at Zero Rate

Ling-Hua Chang, Po-Ning Chen, Fady Alajaji +1

The generalized Poor-Verdu error lower bound for multihypothesis testing is revisited. Its asymptotic expression is established in closed-form as its tilting parameter grows to inf…

cs.IT2017

On the Maximum Size of Block Codes Subject to a Distance Criterion

Ling-Hua Chang, Po-Ning Chen, Vincent Y. F. Tan +2

We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than . The achievability argument involves an iterative c…

cs.IT2014★ 1 cited

An Improved RIP-Based Performance Guarantee for Sparse Signal Recovery via Orthogonal Matching Pursuit

Ling-Hua Chang, Jwo-Yuh Wu

A sufficient condition reported very recently for perfect recovery of a K-sparse vector via orthogonal matching pursuit (OMP) in K iterations is that the restricted isometry consta…

cs.IT2012★ 16 cited

Achievable Angles Between two Compressed Sparse Vectors Under Norm/Distance Constraints Imposed by the Restricted Isometry Property: A Plane Geometry Approach

Ling-Hua Chang, Jwo-Yuh Wu

The angle between two compressed sparse vectors subject to the norm/distance constraints imposed by the restricted isometry property (RIP) of the sensing matrix plays a crucial rol…