3 citations · 4 across the 10 of their papers we have counts for
10 papers
The Story of : ALOHA-based and Reinforcement-Learning-based Random Access for Delay-Constrained Communications
Lei Deng, Danzhou Wu, Jing Deng +2
Motivated by the proliferation of real-time applications in multimedia communication systems, tactile Internet, and cyber-physical systems, supporting delay-constrained traffic bec…
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…
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…
Delay-Constrained Input-Queued Switch
Lei Deng, Wing Shing Wong, Po-Ning Chen +2
In this paper, we study the delay-constrained input-queued switch where each packet has a deadline and it will expire if it is not delivered before its deadline. Such new scenario…
Weak Flip Codes and their Optimality on the Binary Erasure Channel
Hsuan-Yin Lin, Stefan M. Moser, Po-Ning Chen
This paper investigates fundamental properties of nonlinear binary codes by looking at the codebook matrix not row-wise (codewords), but column-wise. The family of weak flip codes…
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…