**Personal
use of this material is allowed. Permission to reprint/republish this material
for advertising or promotional purposes or for creating new collective works
for resale or redistribution to servers or lists, or to reuse any copyrighted
component of this work in other works must be obtained from the original
copyright owners, such as IEEE, ACM, Elsevier, Springer, Kluwer, and so on. **

*Dissertation*

“Efficient Soft-Decision Decoding Algorithms for Linear Block
Codes Using Algorithm A*,” School of Computer and Information Science,
Syracuse University.1993. **(winner of
1994 Syracuse University Doctoral Prize)**

*Book
Chapters*

**Y. S. Han **and P.-N. Chen, “Sequential Decoding of
Convolutional Codes,”** Encyclopedia of Telecommunications** (Editor:
John Proakis), New York, Wiley, 2002, pp. 2140-2164.

*Refereed
papers*

1.
N. Wang, W. Yan, H. Jiang, S.-J. Lin, and **Y. S. Han**, “Prefix Coding Scheme Supporting Direct Access without
Auxiliary Space,” ** IEEE
Transactions on Knowledge and Data Engineering**, to appear.

2.
W. Yan, S.-J. Lin, and **Y. S. Han**, “A New Metric and the Construction for Evolving 2-Threshold
Secret Sharing Schemes Based on Prefix Coding of Integers," ** IEEE Trans. on Communications**,
to appear.

3.
J. Rui, Q. Huang, **Y. S. Han**, and T.-Y. Wu, “Optimal Busy-Node Repair of (k + 4, k, 4) MDS Codes with
Small Sub-packetization Level,” ** IEEE Communications Letters**, pp.
1080-1084, April, 2023.

4.
J. Li, X. Tang, H. Hou, **Y. S. Han**, B. Bai, and G.
Zhang, “PMDS Array Codes with Small Sub-packetization,
Small Repair Bandwidth/Rebuilding Access,'' ** EEE Trans. on
Information Theory**, pp. 1551-1566, March, 2023.

5.
C. Quan, N. Sriranga, H. Yang, **Y.
S. Han**, B. Geng, and P. K. Varshney, “Efﬁcient Ordered-Transmission Based Distributed
Detection under Data Falsiﬁcation Attacks,” ** IEEE Signal Processing Letters**,
pp. 145-149, February, 2023.

6.
H. Hou, **Y. S. Han**, P. P. C. Lee, Y. Wu, G. Han, and
M. Blaum, “A Generalization of
Array Codes with Local Properties and Efficient Encoding/Decoding,” ** IEEE Trans. on Information Theory**,
pp. 107-125, January, 2023.

7.
N. Tang and **Y. S. Han**, “A New
Decoding Method for Reed–Solomon Codes Based on FFT and Modular Approach,” ** IEEE Trans. on Communications**,
pp. 7790-7801, December, 2022.

8.
L.-H. Chang, P.-N. Chen, F. Alajaji,
and **Y. S. Han,** “Decoder Ties Do Not Affect the
Error Exponent of the Memoryless Binary Symmetric Channel,” ** IEEE Trans. on Information Theory**, pp.
3501-3510, June, 2022.

9.
C. Quan, B. Geng, **Y. S. Han**,
and P. K. Varshney, “Enhanced Audit Bit Based
Distributed Bayesian Detection in the Presence of Strategic Attacks,” ** IEEE Trans. on Signal and
Information Processing over Networks**, pp. 49 - 62, January,
2022.

10. Z. Li, S.-J. Lin,
P.-N. Chen, **Y. S. Han**, and H. Hou, “Update
Bandwidth for Distributed Storage,” ** IEEE Trans. on
Information Theory**, pp. 7159-7179, November, 2021.

11. L. Deng, Y. Yu, Y.
Zhang and **Y. S. Han**, “Comparing Delay-Constrained
ALOHA and CSMA: A Learning-Based Low-Complexity Approximate Approach,” ** IEEE Open Journal of the
Communications Society**, vol. 2, pp. 1721-1735, 2021.

12. **Y. S. Han**, C. Chen, S.-J. Lin,
and B. Bai, “On Fast Fourier Transform-Based Decoding
of Reed-Solomon Codes,” ** Int. J. Ad Hoc and Ubiquitous Computing**, pp. 180-187,
36(3), 2021.

13. N. Wang, S.-J. Lin, **Y.
S. Han**, and N. Yu, “Variants of Golomb Coding and
the n-ary Versions,” ** IEEE
Trans. on Communications**, pp. 7460 - 7472, December,
2020.

14. H. Hou, **Y. S. Han**,
and P. C. C. Lee, “Two Classes of Binary MDS Array
Codes with Asymptotically Optimal Repair for Any Single Column,” ** IEEE Trans. on Communications**,
pp. 6723 - 6736, November, 2020.

15. H. Hou, P. C. C. Lee,
and **Y. S. Han**, “Zigzag-Decodable Reconstruction
Codes with Asymptotically Optimal Repair for All Nodes,” ** IEEE Trans. on Communications**, pp.
5999-6011, October, 2020.

16. H.-Y. Lin, P.-N.
Chen, **Y. S. Han**, and P. K. Varshney,
“Minimum Byzantine Effort for Blinding Distributed
Detection in Wireless Sensor Networks,” ** IEEE Trans. on
Signal Processing**, pp. 647-661, 2020.

17. L. Yu, Z. Lin, S.-J.
Lin, **Y. S. Han**, and N. Yu, “Fast Encoding Algorithms for Reed-Solomon Codes with between
Four and Seven Parity Symbols,” ** IEEE Trans. on Computers**, pp. 699-705, May,
2020.

18. H. Hou, **Y. S. Han**, P. C. C. Lee, Y. Hu, and H.
Li, “A New Design of Binary MDS Array Codes with
Asymptotically Weak-Optimal Repair,” ** IEEE Trans. on Information
Theory**, pp. 7095-7113, November, 2019.

19. S.-J. Lin, **Y. S. Han**, and N. Yu, “New Locally Correctable Codes Based on Projective
Reed--Muller Codes,” ** IEEE Trans. on Communications**, pp. 3834-3841, June,
2019.

20. L.-H. Chang, P.-N.
Chen, V. Y. F. Tan, C. Wang, and **Y. S.
Han**, “On the Maximum Size of Block Codes Subject to a
Distance Criterion,” ** IEEE Trans. on Information
Theory**, pp. 3751-3757, June, 2019.

21. H. Cao, S.-J. Lin, W.
Zhang, and **Y. S. Han**, “On the Security of Secret Sharing over a Ring and the Fast
Implementation,” ** IEEE Signal Processing Letters**, pp. 705-709, May, 2019.

22. C. Chen, S.-J. Lin,
and **Y. S. Han**, “Extended
Versions of Polynomial Remainder Codes and Chinese Remainder Codes,” ** IEEE Communications Letters**,
pp. 2407-2410, December, 2018.

23. L. Deng, W. S. Wong,
P.-N. Chen, **Y. S. Han**, and H. Hou, “Delay-Constrained Input-Queued Switch,” ** IEEE Journal on Selected Areas in
Communications (JSAC): special issue on Emerging Technologies in Tactile
Internet and Backhaul/Fronthaul networks**, pp. 2464-2474,
November, 2018.

24. H. Hou, **Y. S. Han**, K. W. Shum, and H. Li, “A Unified Form of EVENODD and RDP Codes and Their
Efficient Decoding," ** IEEE Trans. on Communications**, pp. 5053 - 5066,
November, 2018.

25. H. Hou and **Y. S. Han**, “A Class
of Binary MDS Array Codes with Asymptotically Weak-Optimal Repair,” ** SCIENCE CHINA Information Sciences**,
pp. 100302:1–100302:11, October, 2018.

26. C.-Y. Wei, H.-Y. Lin,
P.-N. Chen, **Y. S. Han**, and P. K.
Varshney, “Target Localization Using Sensor Location
Knowledge in Wireless Sensor Networks,” ** IEEE Wireless Communications Letters**,
pp. 456-459, July, 2018.

27. **Y. S. Han**, T.-Y. Wu, P.-N. Chen, and P. K. Varshney, “A Low-Complexity Maximum-Likelihood Decoder for
Tail-Biting Convolutional Codes,” ** IEEE Trans. on Communications**, pp. 1859-1870, May, 2018.

28. C. Huang, T.-Y. Wu,
P.-N. Chen, F. Alajaji, and **Y. S. Han**, “An Efficient Tree Search Algorithm
for the Free Distance of Variable-Length Error-Correcting Codes,”** IEEE Communications Letters**,
pp. 474-477, March, 2018.

29. H. Hou and **Y. S. Han**, “A
New Construction and an Efficient Decoding Method for Rabin-Like Codes,” ** IEEE Trans. on Communications**,
pp. 521-533, February, 2018.

30. C.-Y. Wei, P.-N.
Chen, **Y. S. Han**, and P. K. Varshney,
“Local Threshold Design for Target Localization Using
Error Correcting Codes in Wireless Sensor Networks in the Presence of Byzantine
Attacks,” ** IEEE Trans. on
Information Forensics and Security**, pp. 1517-1584, July 2017.

31. M. A. Mulatu, L.-C. Chang, **Y.
S. Han**, F. G. Mengistu, and D.-F. Tseng, “Threshold-Based Cooperative
Communication of Energy Harvesting Active Networked Tags,” ** Int. J. Ad Hoc and Ubiquitous Computing**,
pp. 225-236, 24(4), 2017.

32. S.-J. Lin, T. Y. Al-Naffouri, **Y. S. Han**,
and W.-H. Chung, “Novel Polynomial Basis with Fast
Fourier Transform and Its Application to Reed-Solomon Erasure Codes” ** IEEE Trans. on Information Theory**,
pp. 6284-6299, November, 2016.

33. S.-J. Lin, T. Y. Al-Naffouri, and **Y. S.
Han**, “FFT Algorithm for Binary Extension Finite
Fields and its Application to Reed-Solomon Codes,” ** IEEE Trans. on Information Theory**, pp.
5343-5358, October, 2016.

34. J.-T. Tsai and **Y. S. Han**, “Geographic routing with
enhanced local information for wireless networks,” ** Journal of Information Science and Engineering**,
pp. 1261-1288, September, 2016.

35. R. El-Bardan, E. Masazade, O. Ozdemir, **Y. S. Han**, and P. K. Varshney,
“Permutation Trellis Coded Multi-level FSK Signaling to Mitigate Primary User
Interference in Cognitive Radio Networks,” ** IEEE Trans. on Communications**, pp.104-116, January
2016.

36. B. Kailkhura, **Y. S. Han**,
S. Brahma, and P. K. Varshney, “Distributed Bayesian
Detection in the Presence of Byzantine Data,” ** IEEE Trans. on Signal Processing**, pp.
5250 - 5263, October, 2015.

37. B. Kailkhura, S. Brahma, B.
Dulek, **Y.
S. Han**, and P. K. Varshney, “Distributed Detection
in Tree Networks: Byzantines and Mitigation Techniques,” ** IEEE Trans. on Information
Forensics and Security**, pp. 1499-1512, July, 2015.

38. **Y. S. Han**, H.-T. Pai, R. Zheng, and P. K. Varshney, “Update-Efficient Error-Correcting Product-Matrix Codes,”
** IEEE Trans. on Communications**,
pp. 1925-1938, June, 2015.

39. B. Kailkhura, **Y. S. Han**,
S. Brahma, and P. K. Varshney, “Asymptotic Analysis of
Distributed Bayesian Detection with Byzantine Data,” ** IEEE Signal Processing Letters**, pp. 608-611, May, 2015.

40. S.-J. Lin, W.-H.
Chung, **Y. S. Han**, and T. Y. Al-Naffouri, “A Unified Form of Exact-MSR
Codes via Product-Matrix Frameworks,” ** IEEE Trans. on Information Theory**, pp. 873-886,
February, 2015.

41. D.-F. Tseng, F. G.
Mengistu, **Y. S. Han**, M. A. Mulatu, L.-C. Chang, and T.-R. Tsai, “Robust Turbo Decoding in a Markov Gaussian Channel,” ** IEEE Wireless Communications
Letters**, pp. 633-636, December, 2014.

42. F. G. Mengistu, D.-F.
Tseng, **Y. S. Han**, M. A. Mulatu, and L.-C. Chang, “A
Robust Decoding Scheme for Convolutionally Coded Transmission Through a Markov
Gaussian Channel,” ** IEEE Trans. on Vehicular Technology**, pp. 4344-4356,
November, 2014.

43. B. Kailkhura, S. Brahma, **Y.
S. Han**, and P. K. Varshney, “Distributed Detection in
Tree Topologies with Byzantines,” ** IEEE Trans. on Signal Processing**, pp. 3208-3219, June,
2014.

44. V. S. S. Nadendla, **Y. S. Han**, and P. K. Varshney, “Distributed Inference with M-ary Quantized Data in the
Presence of Byzantine Attacks,” ** IEEE Trans. on Signal Processing**, pp. 2681-2695, May, 2014.

45. **Y. S. Han**, H.-T. Pai, R. Zheng, and W. H. Mow, “Efficient Exact Regenerating Codes for Byzantine Fault
Tolerance in Distributed Networked Storage,” ** IEEE Trans. on Communications**, pp.
385-397, February, 2014.

46. A. Vempaty, **Y. S. Han**,
and P. K. Varshney, “Target Localization in Wireless
Sensor Networks using Error Correcting Codes,” ** IEEE Trans. on Information Theory**, pp.
697-712, January, 2014.

47. D.-F. Tseng, **Y. S. Han**, W. H. Mow, P.-N. Chen, J.
Deng, and A. J. Han Vinck, “Robust
Decoding for Convolutionally Coded Systems Impaired by Memoryless Impulsive
Noise,”** IEEE Trans. on Communications**,
pp. 4640-4652, November, 2013.

48. T.-Y. Wu, P.-N. Chen,
F. Alajaji, and **Y.
S. Han**, “On the Design of Variable-Length
Error-Correcting Codes,” ** IEEE Trans. on Communications**, pp. 3553-3565,
September, 2013.

49. J. Deng and **Y. S. Han**, “Cooperative
Secret Delivery in Wireless Sensor Networks,” ** Int. J. Ad Hoc and Ubiquitous Computing**,
Vol. 14, No. 4, pp. 226-237, 2013.

50. **Y. S. Han, **S. Omiwade, and R. Zheng, “Progressive Data Retrieval for Distributed Networked
Storage,” ** IEEE Trans. on
Parallel and Distributed Systems**, pp. 2303-2314, December, 2012

51. J. Deng, S. C.-H. Huang, and **Y. S. Han**, “An On-line Relay Selection
Scheme in Power Controllable Wireless Sensor Networks,” ** International Journal of Distributed Sensor Networks**, Vol. 2012, Article ID 213598, 13 pages.

52. D.-F. Tseng**, Y. S. Han, **W.
H. Mow, L.-C. Chang, and A. J. Han Vinck, “Robust Clipping for OFDM Transmissions over Memoryless Impulsive Noise Channels,” ** IEEE Communications Letters**, pp. 1110-1113, July, 2012.

53. **Y. S. Han**, T.-Y. Wu, H.-T. Pai and P.-N. Chen, “The Modified
Wrap-Around Viterbi Algorithm for Convolutional Tail-Biting Codes,” ** Journal of the Chinese Institute
of Engineers**, pp. 431-437, June, 2012.

54. T.-R. Tsai, D.-F. Tseng, **Y.**** S. Han**, and
H.-T. Pai, “Improved EXIT Analysis for Turbo
Decoding,” ** IEEE Communications
Letters**, pp. 995-997, September, 2011.

55. H.-T. Pai, **Y. S. Han**, and Y.-J. Chu, “New HARQ Scheme Based on Decoding of Tail-biting
Convolutional Codes in IEEE 802.16e,” ** IEEE Trans. on Vehicular Technology**, pp. 912-918,
March, 2011.

56. S.-L. Shieh, P.-N.
Chen, **Y. S. Han**, and T.-Y. Wu, “Early-Elimination Modification for Priority-First Search
Decoding,” ** IEEE Trans. on Communications**,
pp. 3459-3469, December, 2010. (

57. Y.-M. Huang, T.-Y.
Wu, and **Y. S. Han**, ``An A*-based Algorithm for Constructing Reversible
Variable Length Codes with Minimum Average Codeword Length,” *IEEE*** Trans. on Communications**, pp. 3175-3185,
November, 2010.

58. H.-T. Pai, J. Deng,
and **Y. S. Han**, “Time-Slotted Voting
Mechanism for Fusion Data Assurance in Wireless Sensor Networks Under Stealthy
Attacks,” ** Computer Communications**, pp.
1524-1530, August, 2010.

59. C.-L. Wu, P.-N. Chen,
**Y. S. Han**, and M.-H. Kuo, “Maximum-Likelihood Priority-First
Search Decodable Codes for Combined Channel Estimation and Error Correction,*” IEEE Trans. on Information Theory*, pp.
4191-4203, September 2009.

60. J. Deng, **Y. S. Han**, and S. R. Kulkarni, “Can Multiple Subchannels Improve the Delay Performance of
RTS/CTS-based MAC Schemes?” ** IEEE Trans. on
Wireless Communications**, pp. 1591-1596, April, 2009.

61. H.-T. Pai, **Y. S. Han**, T.-Y. Wu, P.-N. Chen, and
S.-L. Shieh, “Low-Complexity ML Decoding for
Convolutional Tail-Biting Codes,”** IEEE
Communications Letters**, pp. 883-885, December, 2008.

62. S. C.-H. Huang, P.-J.
Wan, J. Deng, and **Y. S. Han**, “Broadcast Scheduling in Interference Environment,” ** IEEE Trans. on Mobile Computing**, pp.
1338-1348, November, 2008.

63. C.-Y. Wang, P.-N.
Chen, W.-T. Chen, S.-L. Shieh, and **Y. S.
Han**, “An Efficient SNR Estimate Scheme for Turbo Decoder Over Quasi-Static
Channels,” ** International Journal of Electrical Engineering
(IJEE)**, pp. 261-268, 2008.

64. Y.-M. Huang, **Y. S. Han**, and T.-Y. Wu, “Soft-Decision Priority-First Decoding Algorithms for
Variable-Length Error-Correcting Codes,” ** IEEE
Communications Letters**, pp. 572-574, August, 2008.

65. J. Deng and **Y. S. Han**, “Multi-path
Key Establishment for Wireless Sensor Networks Using Just Enough Redundancy
Transmission,” ** IEEE Trans. on Dependable and Secure
Computing**, pp. 177-190, July-September,
2008. (

66. H.-T. Pai, **Y. S. Han**, and J.-T. Sung, “Two-Dimensional Coded Classification Schemes in Wireless
Sensor Networks,” ** IEEE Trans. on
Wireless Communications**, pp. 1450-1455, May, 2008.

67. H.-T. Pai and **Y. S. Han**, “Power-Efficient
Direct-Voting Assurance for Data Fusion in Wireless Sensor Networks,” ** IEEE Trans. on Computers**, pp. 261-273,
February, 2008. (

68. J. Deng, **Y. S. Han**, P.-N. Chen, and P. K.
Varshney, “Optimal Transmission Range for Wireless Ad Hoc
Networks Based on Energy Efficiency,” ** IEEE Trans. on
Communications**, pp. 1772-1782, September, 2007. (

69. S.-L. Shieh, P.-N.
Chen, and **Y. S. Han**, “Flip CRC Modification for Message Length Detection,” ** IEEE Trans. on Communications**, pp.
1747-1756, September, 2007. (

70. H.-T. Pai, J.-T.
Sung, and **Y. S. Han**, “Adaptive Retransmission with Balanced Load for Fault-Tolerant
Distributed Detection in Wireless Sensor Networks,” ** Journal
of Information Science and Engineering: special issue on Wireless Ad Hoc and
Sensor Networks**, pp. 1141-1154, July, 2007. (

71. C. Yao, P.-N. Chen,
T.-Y. Wang, **Y. S. Han**, and P. K.
Varshney, “Performance Analysis and Code Design for Minimum
Hamming Distance Fusion in Wireless Sensor Networks,” ** IEEE
Trans. on Information Theory**, pp. 1706-1715, May, 2007. (

72. Y.-J. Chen, D.-R.
Duh, and** Y. S. Han, “**An Improved Modulo (2* ^{n}*+1)
Multiplier for IDEA,”

73. C.-W. Chang, P.-N.
Chen, and **Y. S. Han**, “A Systematic Bit-wise Decomposition of M-ary Symbol Metric,”
** IEEE Trans. on Wireless Communications**, pp. 2742-2751, October, 2006.

74. **Y. S. Han**, J. Deng, and Z. J. Haas, “Analyzing
Multi-Channel Medium Access Control Schemes with ALOHA Reservation,” ** IEEE Trans. on Wireless Communications**, pp. 2143-2152, August, 2006.

75. T.-Y. Wang, **Y.
S. Han**, B. Chen, and P. K. Varshney, “A Combined
Decision Fusion and Channel Coding Scheme for Distributed Fault-Tolerant
Classification in Wireless Sensor Networks,” ** IEEE
Trans. on Wireless Communications**, pp. 1695-1705, July, 2006.

76. J. Deng, **Y. S. Han**, and Z. J. Haas, “Analyzing Split Channel Medium Access Control Schemes,”
** IEEE Trans. on Wireless Communications**,
pp. 967-971, May, 2006.

77. W. Du, J. Deng, **Y. S. Han**, and P. K. Varshney “A Key Pre-distribution Scheme for Sensor Networks Using
Deployment Knowledge,” ** IEEE Trans. on
Dependable and Secure Computing**, pp. 62-77, January, 2006. (

78. J. Deng, **Y. S. Han**, W. B. Heinzelman,
and P. K. Varshney, “Scheduling Sleeping Nodes in High
Density Cluster-based Sensor Networks,” ** ACM/Kluwer
MONET: special issue on “Energy
Constraints and Lifetime Performance in Wireless Sensor Networks,”**
pp. 825-835, December, 2005.

79. T.-Y. Wang,** Y. S. Han**, and P. K. Varshney, “Fault-Tolerant Distributed Classification Based on
Non-binary Codes in Wireless Sensor Networks,” ** IEEE
Communications Letters**, pp. 808-810, September, 2005.

80. J. Deng, **Y. S. Han**, W. B. Heinzelman,
and P. K. Varshney, “Balanced-energy Sleep Scheduling
Scheme for High Density Cluster-based Sensor Networks,” ** Computer Communications: special issue on ASWN04**,
pp. 1631-1642, September, 2005.

81. W. Du, J. Deng,** Y. S. Han**, P. K. Varshney, J. Katz,
and A. Khalili, “A Pairwise Key Pre-distribution
Scheme for Wireless Sensor Networks,” ** ACM Trans. on
Information and System Security (TISSEC)**, pp. 228-258, May,
2005.

82. T.-Y. Wang, **Y. S. Han,** P. K. Varshney, and P.-N.
Chen, “Distributed Fault-Tolerant Classification in
Wireless Sensor Networks,” ** IEEE Journal on
Selected Areas in Communications (JSAC): special issue on Self-Organizing
Distributed Collaborative Sensor Networks**, pp. 724-734, April,
2005.

83. C.-C. Lee, P.-C.
Chung, D.-R. Duh, **Y. S. Han**, and
C.-W. Lin, “A Practice of a Collaborative Multipoint
Medical Teleconsultation System on Broadband Network,” ** Journal
of High Speed Networks**, pp. 207-222, September,
2004.

84. **Y. S. Han**, P.-N. Chen and H.-B. Wu, “A
Maximum-Likelihood Soft-Decision Sequential Decoding Algorithm for Binary
Convolutional codes,” ** IEEE Trans. on
Communications**, pp. 173-178, February, 2002.

85. P.-N. Chen and **Y. S. Han**, “Asymptotic
Minimum Covering Radius of Block Codes,” ** SIAM
Journal on Discrete Mathematics**, pp. 549-564, November, 2001.

86. P.-N. Chen, T.-Y.
Lee, and **Y. S. Han**, “Distance-Spectrum Formulas on the Largest Minimum Distance of
Block Codes,”* IEEE Trans. on Information Theory*,
pp. 869-885, May, 2000.

87. **Y. S. Han**, “A New Decoding Algorithm for
Complete Decoding of Linear Block Codes,”** SIAM
Journal on Discrete Mathematics**, pp. 664-671, November, 1998.

88. **Y. S. Han**, “A New Treatment of Priority-First
Search Maximum-Likelihood Soft-Decision Decoding for Linear Block Codes,”** IEEE Trans. on Information Theory**, pp.
3091-3096, November, 1998.

89. **Y. S. Han**, C. R. P. Hartmann, and K. G. Mehrotra, “Decoding Linear Block Codes Using a Priority-First
Search: Performance Analysis and Suboptimal Version,”** IEEE
Trans. on Information Theory**, pp. 1233-1246, May, 1998.

90. **Y. S. Han**, and C. R. P. Hartmann, “The Zero-Guards
Algorithm for General Minimum Distance Decoding Problem,”* IEEE Trans. on Information Theory*,
pp. 1655-1658, September, 1997.

91. D. L. Tao, C. R. P.
Hartmann, and **Y. S. Han**, “New Encoding/Decoding Methods for Designing Fault-Tolerant
Matrix Operations,”** IEEE Trans. on
Parallel and Distributed Systems**, pp. 931-938, September, 1996.

92. **Y. S. Han**, C. R. P. Hartmann, and C-C. Chen, “Efficient Priority-First Search
Maximum-Likelihood Soft-Decision Decoding of Linear Block Codes,”* IEEE Trans. on Information Theory*,
pp. 1514-1523, September, 1993.

*Refereed Conference *

1.
F. Sun, Q. Huang, J. Rui, T.-Y. Wu, and **Y. S. Han**,
“Side Encoding for MDS Array Codes,” *2023 International Symposium on Information Theory (ISIT2023)*,
Taipei, Taiwan, June, 2023.

2.
C. Chen, S.-J. Lin, Z. Li, S. Cai, and **Y. S. Han**,
“Reduced-Complexity Erasure Decoding of Low-Rate Reed-Solomon Codes Based on
LCH-FFT,” *2023
International Symposium on Information Theory (ISIT2023)*, Taipei,
Taiwan, June, 2023.

3.
Z. Li, W. H. Mow, **Y. S. Han**, and T.-Y. Wu,
“Cache-Aided Distributed Storage System,” *2023 International Symposium on Information Theory
(ISIT2023)*, Taipei, Taiwan, June, 2023.

4.
Z. Li, **Y. S. Han**, S.-J. Lin, and C. Chen, “An Eﬃcient
Reed-Solomon Erasure Code over Cantor-Constructed Binary Extension Finite
Fields,” *2023
International Symposium on Information Theory (ISIT2023)*, Taipei,
Taiwan, June, 2023.

5.
C. Chen, **Y. S. Han**, N. Tang, and S.-J. Lin, “An
Early-Termination Method for the Welch-Berlekamp
Algorithm,” *2023
International Symposium on Information Theory (ISIT2023)*, Taipei,
Taiwan, June, 2023.

6.
C. Quan, B. Geng, **Y. S. Han**,
and P. K. Varshney, “Human-machine Hierarchical Networks for Decision Making in
the Presence of Byzantine Attacks,” *57th Annual Conference on Information Sciences and Systems (CISS2023),*
Baltimore, Maryland, March, 2023.

7.
N. Tang, **Y. S. Han**, and H. Ren, “On Concatenated
Coding Scheme for High-Speed Ethernet," *25th International Conference on Advanced
Communications Technology (ICACT2023)*, Phoenix Pyeongchang, Korea,
February, 2023

8.
J. Deng, P.-N. Chen, and **Y. S. Han**,
“Perturbation-based MAC for Dense Wireless Networks with Periodic
Traffic," *2023
International Conference on Computing, Networking and Communications (ICNC):
Mobile and Wireless Networking*, Honolulu, Hawaii, February, 2023.

9.
C. Quan, **Y. S. Han**, B. Geng,
and P. K. Varshney, “Reputation and Audit Bit Based Distributed Detection in
the Presence of Byzantines,” *the
56th Asilomar Conference on Signals, Systems, and Computers*, Pacific
Grove, CA, October, 2022.

10.
H. Hou, **Y. S. Han**, B. Bai, and G. Zhang, “Towards
Efficient Repair and Coding of Binary MDS Array Codes with Small
Sub-Packetization,”* 2022
International Symposium on Information Theory (ISIT2022)*, Espoo,
Finland, June, 2022.

11.
H. Shi, H. Hou, **Y. S. Han,** P. P. C. Lee, Z. Jiang, Z.
Huang, and B. Bai, “New Piggybacking Codes with Lower Repair Bandwidth for Any
Single-Node Failure,” *2022
International Symposium on Information Theory (ISIT2022),* Espoo,
Finland, June, 2022.

12.
Z. Tang, S.-J. Lin, **Y. S. Han**, Z. Huang, B. Bai, and
G. Zhang, “Data Integrity Check in Distributed Storage Systems,” *2022 International Symposium on
Information Theory (ISIT2022),* Espoo, Finland, June, 2022.

13.
J. Li, X. Tang, H.
Hou, **Y. S. Han**, B. Bai, and G. Zhang, “PMDS Array Codes with Small Sub-Packetization
Level and Small Repair Bandwidth,”* 2022 International Symposium on Information Theory (ISIT2022),*
Espoo, Finland, June, 2022.

14.
D. Wu, L. Deng, Z. Liu, Y.
Zhang, **Y. S. Han**, “RL Random Access for Delay-Constrained Heterogeneous
Wireless Networks: A Two-User Case,” *IEEE 2021 Global Communications Conference: Workshop-AiWN*,
Madrid, Spain, December, 2021.

15.
Z. Li, **Y. S. Han**, T.-Y.
Wu, H. Hou, B. Bai, and G. Zhang, “On the Repair Bandwidth and Repair Access of
Two Storage Systems: Large-Scale and Uniform Rack-Aware Storage Systems,” *2021 IEEE Information Theory
Workshop (ITW 2021)*, Kanazawa, Japan, October, 2021.

16.
T.-Y. Wu, **Y. S. Han**, Z.
Li, B. Bai, G. Zhang, “Achievable Lower Bound on the Optimal Access Bandwidth
of (K+2, K, 2)-MDS Array Code with Degraded Read Friendly,” *2021 IEEE Information Theory
Workshop (ITW 2021)*, Kanazawa, Japan, October, 2021.

17.
Z. Jiang, H. Hou, **Y. S. Han**,
Z. Huang, B. Bai, and G. Zhang, “An Efficient Piggybacking Design with Lower
Repair Bandwidth and Lower Sub-packetization,” *2021 International Symposium on Information Theory
(ISIT2021)*, Melbourne, Victoria, Australia, July, 2021.

18.
Y. Wu, H. Hou, **Y. S. Han**,
P. P. C. Lee, and G. Han, “Generalized Expanded-Blaum-Roth
Codes and Their Efficient Encoding/Decoding,” *IEEE 2020 Global Communications Conference (Globecom 2020)*, Taipei, December, 2020.

19.
Y. Yu, L. Deng, Y. Zhang, and **Y.
S. Han**, “Comparing Delay-Constrained ALOHA and CSMA: A Learning-Based
Low-Complexity Approximate Approach,” *IEEE International Conference on Control & Automation (IEEE ICCA
2020)*, Sapporo, Japan, October, 2020. **(Invited paper)**

20.
T.-Y. Wu and **Y. S. Han**,
“ML Soft-decision Decoding for Binary Linear Block Codes Based on Trellises of
Their Supercodes,” *The 29th International Conference on Computer
Communications and Networks (ICCCN 2020)*, Honolulu, Hawaii, August,
2020. **(Invited paper)**

21.
L.-H. Chang, P.-N. Chen, F. Alajaji, and **Y. S. Han**, “The Asymptotic Generalized
Poor-Verdú Bound Achieves the BSC Error Exponent at
Zero Rate,” *2020
International Symposium on Information Theory (ISIT2020)*, Los
Angeles, California, June, 2020.

22.
Z. Li, S.-J. Lin, and **Y. S.
Han,** “On the Exact Lower Bounds of Encoding Circuit Sizes of Hamming Codes
and Hadamard Codes,”* 2020
International Symposium on Information Theory (ISIT2020)*, Los Angeles,
California, June, 2020.

23.
H. Hou, P. P. C. Lee, and **Y.
S. Han**, “Minimum Storage Rack-Aware Regenerating Codes with Exact Repair
and Small Sub-Packetization,”*
2020 International Symposium on Information Theory (ISIT2020)*, Los
Angeles, California, June, 2020.

24.
H. Hou, P. P. C. Lee, and **Y.
S. Han**, “Toward Optimality in Both Repair and Update via Generic MDS Code
Transformation,”* 2020
International Symposium on Information Theory (ISIT2020)*, Los
Angeles, California, June, 2020.

25.
C. Chen, **Y. S. Han**, Z. Wang, and B. Bai, “A New Inversionless
Berlekamp-Massey Algorithm with Efficient
Architecture,” *The IEEE International Workshop on Signal Processing
Systems (SiPS 2019)*, Nanjing, P. R. China,
October, 2019.

26.
S.-J. Lin, Z. Gao, and **Y. S. Han**, “Arithmetic Coding Based on
Reflected Binary Codes,” *The 9th International Workshop on
Signal Design and its Applications in Communications (IWSDA 2019)*,
Dongguan, P. R. China, October, 2019.

27.
H. Hou, **Y. S. Han**, and P. P. C. Lee, “Binary MDS Array Codes with Asymptotically
Optimal Repair for All Columns,” *The 28th International Conference
on Computer Communications and Networks (ICCCN 2019)*, Valencia,
Spain, July, 2019. **(Invited paper)**

28.
H. Hou, **Y. S. Han**, P. P. C. Lee, and Q. Zhou, “New Regenerating Codes over Binary Cyclic Codes,” *2019 International
Symposium on Information Theory (ISIT2019)*, Paris, France, July,
2019.

29.
S. Huang, H. Hou, and **Y. S. Han**, “An Improved MDS Condition
of Blaum-Bruck-Vardy Codes,” *The 10th
International Symposium on Turbo Codes & Iterative Information Processing
(ISTC2018)*, Hong Kong, December, 2018.

30.
L. Deng, W. S. Wong, P.-N.
Chen, and **Y. S. Han**,
“Delay-Constrained Input-Queued Switch,” *The Nineteenth International
Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc
2018)*, Los Angeles, USA, June 2018.
(Poster)

31.
L. Deng, J. Deng, P.-N. Chen,
and **Y. S. Han**, “On the Asymptotic
Performance of Delay-Constrained Slotted ALOHA,” *The 27th
International Conference on Computer Communications and Networks (ICCCN 2018)*,
Hangzhou, China, July, 2018. **(Invited
paper)**

32.
H. Hou and **Y. S. Han**, “On Binary MDS Array Codes with Asymptotically
Weak-Optimal Repair,” 2*018 INFORMS International Conference*,
Taipei, June, 2018. **(Invited talk)**

33.
L.-H. Chang, C. Wang, P.-N.
Chen, V. Y. F. Tan and **Y. S. Han**,
“Applications of an exact formula for the largest minimum distance of block
codes,” 52th Annual
Conference on Information Sciences and Systems (CISS), Princeton, NJ,
USA, March 2018.

34.
L.-H. Chang, C. Wang, P.-N.
Chen, **Y. S. Han**, and V. Y. F. Tan,
“Distance Spectrum Formula for the Largest Minimum Hamming Distance of
Finite-Length Binary Block Codes,” *2017 IEEE Information Theory
Workshop (ITW 2017)*,
Kaohsiung, November, 2017.

35.
H. Hou and **Y. S. Han**, “BASIC Codes for Distributed Storage Systems,” *The 26th International Conference on Computer Communications and
Networks (ICCCN 2017)*, Vancouver, Canada, July, 2017. **(Invited paper)**

36.
H. Hou, P. P. C. Lee, **Y. S. Han**, and Y. Hu,
“Triple-Fault-Tolerant Binary MDS Array Codes with Asymptotically Optimal
Repair,” *2017 International Symposium on Information Theory
(ISIT2017)*, Aachen, Germany, June, 2017.

37.
**Y. S. Han**, S.-W. Fu, and P.-N. Chen, “A
New Step-by-Step Complete Decoding Algorithm for Binary Cyclic Codes,” *2017 International Conference on Signals and Systems (ICSigSys’2017)*, Bali, Indonesia, May
2017.

38.
S.-M. Tseng, D.-F. Tseng, T.-R.
Tsai, and **Y. S. Han**, “Robust Turbo
Decoding in Single-Carrier Systems over Memoryless Impulse Noise Channels,” *2016 International Conference on Advanced Technologies for
Communications (ATC'2016)*, Hanoi, Vietnam, October, 2016.

39.
X. Wang, W. H. Mow, and **Y. S. Han**, “List-Output Priority-First
Sequential Decoding for Physical-Layer Network Coding,” *The Thirteenth
International Symposium on Wireless Communication Systems (ISWCS'2016)*,
Poznan, Poland, September, 2016.

40.
P.-N. Chen, **Y. S. Han**, H.-Y. Lin, and P. K.
Varshney, “Optimal Byzantine Attack for Distributed Inference with M-ary Quantized Data,” *2016 International Symposium on
Information Theory (ISIT2016)*, Barcelona, Span, July, 2016.

41.
J.-T. Tsai and **Y. S. Han**, “Cooperative Rotational
Sweep Schemes for Geographic Routing,” *IEEE International Conference on
Communications (ICC'2016)*, Kuala Lumpur, Malaysia, May, 2016.

42.
V. S. S. Nadendla, **Y. S. Han**, and P. K. Varshney, “Information-Dispersal Games for Security in
Cognitive-Radio Networks,” *2015 International Symposium on
Information Theory (ISIT2015)*, Hong Kong, June, 2015.

43.
D.-F. Tseng, L.-C. Chang, and
Y. S. Han, “A Robust Receiver for
OFDM Systems in Nonlinear Impulse Channels,” *2nd IEEE
International Symposium on Telecommunication Technologies (ISTT2014)*,
Langkawi Island, Malaysia, November, 2014.

44.
S.-J. Lin, W.-H. Chung, and **Y. S. Han**, “Novel Polynomial Basis and Its Application
to Reed-Solomon Erasure Codes,” *The 55th Annual IEEE Symposium on
Foundations of Computer Science ( FOCS
2014)*, Philadelphia, October, 2014.

45.
S.-J. Lin, W.-H. Chung, and **Y. S. Han**, “On the Fault-Tolerance of
Unified-Form Exact-MSR Codes,” *The 6th International Symposium on
Communications, Control, and Signal Processing (ISCCSP 2014)*,
Athens, Greece, May, 2014. **(Invited
Talk)**

46.
A. Vempaty,
**Y. S. Han**, L. R. Varshney, and P. K.
Varshney, “Coding Theory for
Reliable Signal Processing,” *The 2014 International Conference
on Computing, Networking and Communication (ICNC 2014)*, Honolulu,
Hawaii, February, 2014. **(Invited
Position Talk)**

47.
B. Kailkhura,
**Y. S. Han**, S. Brahma, and P. K.
Varshney, “On Covert Data
Falsification Attacks on Distributed Detection Systems,” *The 13th
International Symposium on Communications and Information Technologies (ISCIT
2013)*, Samui Island, Thailand, September, 2013.

48.
A. Vempaty,
**Y. S. Han**, and P. K. Varshney,
“Byzantine Tolerant Target Localization in Wireless Sensor Networks Over
Non-Ideal Channels,” *The 13th International Symposium
on Communications and Information Technologies (ISCIT 2013)*, Samui
Island, Thailand, September, 2013.

49.
**Y. S. Han**, H.-T. Pai, R. Zheng, and P.
K. Varshney, “Update-Efficient Regenerating Codes with Minimum Per-Node
Storage,” *2013 International Symposium on Information Theory
(ISIT2013)*, Istanbul, Turkey, July, 2013.

50.
A. Vempaty,
**Y. S. Han**, and P. K. Varshney,
“Target Localization in Wireless Sensor Networks Using Error Correcting Codes
in the Presence of Byzantines,” *The 38th International Conference
on Acoustics, Speech, and Signal Processing (ICASSP 2013)*,
Vancouver, Canada, May, 2013.

51.
B. Kailkhura,
S. Brahma, **Y. S. Han**, and P. K.
Varshney, “Optimal Distributed Detection in the Presence of Byzantines,” *The 38th International Conference on Acoustics, Speech, and Signal
Processing (ICASSP 2013)*, Vancouver, Canada, May, 2013.

52.
D.-F. Tseng, T.-R. Tsai, and **Y. S. Han**, “Robust Turbo Decoding in
Impulse Noise Channels,” *the 17th IEEE International Symposium on Power Line Communications
and its Applications (ISPLC 2013)*, Johannesburg, South Africa,
March, 2013.

53.
D.-F. Tseng**, **R.-B. Yang, T.-R. Tsai,** Y. S. Han, **and W. H. Mow**, “**Efficient
Clipping for Broadband Power Line Systems in Impulsive Noise Environment,” *The 16th IEEE International Symposium on Power Line Communications and
its Applications (ISPLC 2012)*, Beijing, P. R. China, March, 2012.

54.
**Y. S. Han**, R. Zheng, and W. H. Mow, “Exact Regenerating Codes for Byzantine Fault Tolerance
in Distributed Storage,” *The IEEE INFOCOM 2012*,
Orlando, March, 2012.

55.
S.-Y. Huang, C.-L. Wu, P.-N.
Chen, T.-Y. Wang, and **Y. S. Han**,
“Combining Channel Estimation and Sensor Fault Protection in Wireless Sensor
Networks,'” *The 8th International Conference on Information,
Communications and Signal Processing (ICICS 2011)*, Singapore, December,
2011.

56.
D.-F. Tseng, **Y. S. Han**, W. H. Mow, and J. Deng, “Efficient
Decoding over Power-line Channels,” *The 5th International Workshop on
Signal Design and its Applications in Communications (IWSDA '11)*,
Guilin, P. R. China, October, 2011.

57.
T.-Y. Wu, P.-N. Chen, F. Alajaji, **Y. S. Han**,
“On the Construction and MAP Decoding of Optimal Variable-Length
Error-Correcting Codes,” *2011 International Symposium on
Information Theory (ISIT2011)*, Saint-Petersburg, Russia, June, 2011.

58.
J. Deng, S. C.-H. Huang, **Y. S. Han**, and J. H. Deng,
“Fault-Tolerant and Reliable Computation in Cloud Computing,” *IEEE Globecom 2010 Workshop on Web and Pervasive Security (WPS
2010)*, Miami, December, 2010.

59.
C.-Y. Wang, S.-L. Lin, P.-N. Chen, and **Y. S. Han**, “Path Deletions for Finite
Stack-Size Sequential-Type Decoding Algorithms,” *2010 International Symposium on Information
Theory and its Applications (ISITA2010)*, Taichun,
Taiwan, October, 2010.

60.
**Y. S. Han**, S. Omiwade,
and R. Zheng, “Survivable Distributed Storage with
Progressive Decoding,” *IEEE INFOCOM 2010 (mini-conference)*, San
Diego, March, 2010.

61.
J. Deng, **Y. S. Han**, and B. Liang, “Fairness Index Based on Variational
Distance,” *IEEE 2009 Global
Communications Conference (Globecom'2009)*, Hawaii, November,
2009.

62.
C.-L. Wu, M. Skoglund*,*
P.-N. Chen*, *and **Y. S. Han**, “A Systematic
Space-Time Code Design and Its Maximum-Likelihood Decoding for
Combined Channel Estimation and Error Correction,” *2009
International Symposium on Information (ISIT2009)*, Seoul, South Korea, June, 2009.

63.
C.-L. Wu, P.-N. Chen, and **Y. S. Han**, “A Self-Orthogonal Code and Its Maximum-Likelihood
Decoder for Combined Channel Estimation and Error Protection,” *2008 International Symposium on Information
Theory and its Applications (ISITA2008)*,
Auckland, New Zealand, December, 2008.

64.
**Y. S. Han**, T.-Y.
Wu, H.-T. Pai, P.-N. Chen, and S.-L. Shieh, “Priority-First Search Decoding
for Convolutional Tail-biting Codes,” *2008 International Symposium on Information Theory and
its Applications (ISITA2008)*, Auckland, New Zealand, December, 2008.

65.
Y.-M. Huang, C.-F. Lo, and **Y. S. Han**, “Bit- and Trellis- Based Soft-Decision
Sequential Decoding for Variable-Length Error-Correcting Codes,” *The 14 ^{th}
Asia-Pacific Conference on Communications (APCC 2008)*, Tokyo, Japan,
October, 2008.

66.
Y.-M. Huang and **Y. S.
Han**, ‘Trellis-Based Joint Huffman and Convolutional Soft-Decision
Priority-First Decoding,'’ *2008 IEEE Data Compression Conference (DCC 2008)*,
Utah, March, 2008, p. 521.

67.
J. Deng and **Y. S. Han**,
“Babel: Using a Common Bridge Node to Deliver Multiple Keys in Wireless Sensor
Networks,” *Proceedings
of IEEE 2007 Global Communications Conference (Globecom'2007)*,
Washington D.C., November, 2007, pp. 161-165.

68.
S.-L. Shieh, P.-N Chen and Y. S. Han, “Reduction of
Computational Complexity and Sufficient Stack Size of the MLSDA by Early
Elimination,” *the
IEEE International Symposium on Information Theory (ISIT2007)*, Nice,
France, June, 2007, pp. 1671-1675.

69.
P.-N. Chen, T.-Y. Wang, **Y.
S. Han**, and Y.-T. Wang, “On the Design of
Soft-Decision Fusion Rule for Coding Approach in Wireless Sensor Networks,”* International
Conference on Algorithms, Systems, and Applications*, Xian, P. R. China, August, 2006. *Lecture Notes in Computer Science (LNCS), Springer-Verlag*, pp. 140-150, 2006.

70.
P.-N. Chen, T.-Y. Wang, **Y.
S. Han**, P. K. Varshney, C. Yao, and S.-L. Shieh, “Fault-Tolerance Analysis of a
Wireless Sensor Network with Distributed Classification Codes,” *the IEEE
International Symposium on Information Theory, *Seattle, July, 2006, pp.
217-221*.*

71.
H.-T. Pai and** Y. S.
Han**,** **“Power-Efficient Data
Fusion Assurance Using Direct Voting Mechanism in Wireless Sensor Networks,” *Proceedings of the
2006 IEEE International Conference on Sensor Networks, Ubiquitous, and
Trustworthy Computing (SUTC2006)*, Taichung, Taiwan, June, 2006, pp. 2-7.

72. H.-T. Pai, J.-T.
Sung, and **Y. S. Han**, “Adaptive
Retransmission for Distributed Detection in Wireless Sensor Networks,” *Proceedings of
the IEEE Workshop on Ad Hoc and Ubiquitous Computing (AHUC2006)*, Taichung, Taiwan, June, 2006, pp. 368-375.

73. J. Deng and
**Y. S. Han**, “Using MDS Codes for the Key
Establishment of Wireless Sensor Networks,” *International Conference on Mobile Ad-hoc
and Sensor Networks (MSN '05),* *Wuhan, P. R. China, December, 2005. vol.
3794 of Lecture Notes in Computer Science (LNCS), Springer-Verlag*, pp. 732-744, 2005.

74. S.-L.
Shieh, S.-T. Kuo, P.-N Chen and **Y. S. Han**, “Strategies for Blind Transport Format Detection Using
Cyclic Redundancy Check in UMTS WCDMA,” *2005 IEEE International Conference on Wireless and Mobile
Computing, Networking and Communications (WIMOB2005)*,
Montreal, Canada, August, 2005, pp. 44-50.

75. H.-T. Pai, J.-T.
Sung, and **Y. S. Han**, “A Simple Two-Dimensional Coded
Detection Scheme in Wireless Sensor Networks,” *the First IEEE International Workshop in
Heterogeneous Wireless Sensor Networks (HWISE-2005)*, Fukuoka, Japan,
July 2005, pp. 383-387.

76. P.-N. Chen, T.-Y.
Wang, **Y.
S. Han**, P. K. Varshney and C. Yao, “Asymptotic Performance Analysis for
minimum-Hamming-distance fusion,” *IEEE International Conference on Acoustics, Speech, &
Signal Processing 2005 (ICASSP’05), *Philadelphia, USA, March, 2005,
pp. 865-868.

77.
S.-L. Shieh, P.-N. Chen, and **Y. S. Han**, “A Novel Modification of Cyclic Redundancy Check for
Message Length Detection,” *2004 IEEE International Symposium on Information Theory and its
Applications (ISITA2004)*, Parma, Italy, October, 2004.

78.
C.-W. Chang, P.-N. Chen, and **Y. S. Han**, “Realization of a Systematic Bit-wise Decomposition
Metric,” *2004 IEEE Asia-Pacific Conference on Circuits and Systems
(APCCAS'04)*, Tainan, Taiwan, December, 2004, pp.
1065-1068.

79.
J. Deng, **Y. S. Han**,
W. B. Heinzelman, and P. K. Varshney,
“Balanced-energy Sleep Scheduling Scheme for High Density Cluster-based Sensor
Networks,”* 4th Workshop on Applications and Services in Wireless
Networks (ASWN04)*, Boston, Massachusetts,
August, 2004, pp. 99-108. **(Selected for
possible publication in a special issue of Elsevier's Computer Communications
Journal)**

80.
Y.-J. Chen, D.-R. Duh, and **Y. S. Han**, “A New Modulo (2^n+1) Multiplier for IDEA,”* 2004 International Conference on Security and Management (SAM'04)*, Las Vegas, Nevada, June, 2004,
pp. 318-324.

81.
T.-Y. Wang, **Y. S. Han**, and P. K. Varshney, “A
Combined Decision Fusion and Channel Coding Scheme for Fault-Tolerant
Classification in Wireless Sensor Networks,” *2004 IEEE International Conference on
Acoustics, Speech, and Signal Processing (ICASSP 2004)*, Montreal,
Quebec, Canada, May, 2004, pp. 1073-1076.

82.
J. Deng, **Y. S. Han**, P.-N. Chen, and P. K.
Varshney, “Optimum Transmission Range for Wireless Ad Hoc Networks,” *IEEE Wireless
Communications and Networking Conference 2004 (WCNC04)*, Atlanta, GA,
March, 2004, pp. 1024-1029.

83.
W. Du, **Y. S. Han**, and S. Chen,
“Privacy-Preserving Multivariate Statistical Analysis: Linear Regression and
Classification,” *2004
SIAM International Conference on Data Mining (SDM04)*, Lake Buena
Vista, FL, April, 2004, pp. 222-233. (Regular paper)

84.
T.-Y. Wang, **Y. S. Han**, and P. K. Varshney, “Further
Results on Fault-Tolerant Distributed Classification Using Error Correcting
Codes,”*
SPIE's Aerosense conference on Multisensor,
Multisource Information Fusion: Architectures, Algorithms, and Applications*,
Orlando, FL, April, 2004.

85.
W. Du, J. Deng, **Y. S. Han**, S. Chen and P. K. Varshney, “A Key Management Scheme for
Wireless Sensor Networks Using Deployment Knowledge,” *IEEE INFOCOM 2004*, Hong Kong,
March 2004, pp. 586-597.

86.
W. Du, J. Deng, **Y. S. Han**, and P. K. Varshney, “A Pairwise Key Pre-distribution
Scheme for Wireless Sensor Networks,” *10th ACM Conference on Computer and Communications
Security (CCS2003)*, Washington DC, October, 2003, pp. 42-51.

87.
J. Deng, **Y. S. Han**, and Z. J. Haas, “Analyzing Split Channel Medium Access Control Schemes with
ALOHA Reservation,”* *in* Ad-Hoc, Mobile,
and Wireless Networks --ADHOC-NOW '03, S. Pierre, M. Barbeau, and E. Kranakis, Eds. 2003,vol. 2865 of
Lecture Notes in Computer Science (LNCS)*, pp.128-139,
Springer-Verlag.

88.
W. Du, J. Deng, **Y. S. Han**, and P. K. Varshney, “A Witness-Based Approach for Data
Fusion Assurance in Wireless Sensor Networks,” *IEEE 2003 Global Communications Conference
(Globecom'2003)*, San Francisco, CA, December, 2003, pp. 1435-1439.

89.
T.-Y. Wang, **Y. S. Han**, and P. K. Varshney,
“Fault-Tolerant Classification in Multisensor
Networks Using Coding Theory,” *6th International Conference on Information Fusion
(Fusion'2003)*, Cairns, Australia, July, 2003, pp. 772-779. **(invited paper)**

90.
T.-Y. Wang, P. K. Varshney, and **Y. S. Han**, “Distribution
Classification Fusion Using Error Correcting Codes,” *Proceedings of SPIE's Aerosense
2003 conference on Multisensor, Multisource
Information Fusion: Architectures, Algorithms, and Applications*,
Orlando, FL, April, 2003, pp. 47-57.

91.
**Y. S. Han**, P.-N. Chen, and M. Fossorier, “A Generalization of the Fano Metric and its
Effect on Sequential Decoding Using a Stack,” *2002 IEEE International Symposium on
Information Theory*, Lausanne, Switzerland, June, 2002, p. 134.

92.
P.-N. Chen,** Y. S. Han**,
C. R. P. Hartmann, and H.-B. Wu, “Analysis of Decoding Complexity Using New
Variation of Berry-Esseen Theorem,” *2002 IEEE
International Symposium on Information Theory*, Lausanne,
Switzerland, June, 2002, p. 286.

93.
C.-K. Lin, P.-N. Chen, and **Y. S. Han**, “A Low-Complexity Stochastic Codebook Searching
Algorithm for FS1016,” *Workshop on the 21st Century Digital Life and Internet
Technologies*, Tainan, Taiwan, May, 2001.

94.
**Y. S. Han **and P.-N. Chen,
“Asymptotic Covering Radius of Block Codes,” *2000 International Symposium on Information
theory and Its Applications, Honolulu*, Hawaii, November, 2000,
pp.521-524.

95.
T.-Y. Lee, P.-N. Chen and **Y. S. Han**, “Determination of the Asymptotic Largest Minimum
Distance of Block Codes,” *2000 IEEE International Symposium on Information Theory*,
Sorrento, Italy, June, 2000, p. 227.

96.
H.-B. Wu, P.-N. Chen, and **Y. S. Han**, “Investigation of the Maximum-Likelihood Soft-Decision
Sequential Decoding Algorithms for Convolutional Codes,” *1999 International Symposium on
Communications*, Kaohsiung, Taiwan, November, 1999, pp.82-86.

97.
**Y. S. Han**, “A Minimum ρ-Distance Decoding Algorithm of Linear Block Codes Based on
Voronoi Neighbors,” *1997 International Symposium on Communications*,
Hsinchu, Taiwan, December, 1997, pp. 99-103.

98.
**Y. S. Han**, “An Optimal
Gradient Decoding Algorithm for Hard-Decision Decoding of Linear Block Codes,” *1997
International Conference on Combinatorics, Information Theory and Statistics*,
Portland, Maine, July, 1997, p. 36. **(invited speaker)**

99.
**Y. S. Han**, “A New Treatment of
Priority-First Search Maximum-Likelihood Soft-Decision Decoding for Linear
Block Codes,” *1997
IEEE International Symposium on Information Theory*, Ulm, Germany,
June, 1997, p.394. **(honored as long presentation)**

100. **Y. S. Han**, “The Zero-Coverings Algorithm for General Minimum Distance
Decoding Problem,” *1997 IEEE International Symposium on Information Theory*,
Ulm, Germany, June, 1997, p. 330

101. **Y. S. Han**, “The Effect of Heuristic Information on the Soft-Decision
Decoding for Linear Block Codes,” *Seventh IEEE International Symposium on Personal, Indoor
and Mobile Radio Communications*, Taipei, Taiwan, October, 1996, pp.
309-311.

102. **Y. S. Han**, C. R. P. Hartmann, C.-T. Chin, and C. K. Mohan, “Efficient
Suboptimal Decoding of Linear Block Codes,” *32nd Allerton Conference on Communication, Control, and
Computing*, University of Illinois, Urbana-Champaign, September,
1994, pp. 93-102. **(invited
paper)**

103. **Y. S. Han**, C. R. P. Hartmann, and K. G. Mehrotra, “Further Results on
Decoding Linear Block Codes Using a Generalized Dijkstra's Algorithm,” *1994 IEEE
International Symposium on Information Theory*, Trondheim, Norway,
June, 1994, p. 342.

104. **Y. S. Han**, C. R. P. Hartmann, and C-C. Chen, “Efficient Maximum-Likelihood Soft-Decision Decoding
of Linear Block Codes Using Algorithm A*,” *1993 IEEE International Symposium on Information Theory*,
San Antonio, Texas, January 1993, p. 27. **(honored
as long presentation)**

105. D. L. Tao, **Y. S. Han**, and C. R. P. Hartmann, “New
Encoding/Decoding Methods for Designing Fault-Tolerant Matrix Operations,” *SPIE, Advanced
Signal Processing, Algorithms, Architectures, and Implementations III*,
pp. 72-83, July 1992.

*Patents*

1.
S.-L. Shieh, P.-N. Chen, and **Y. S. Han**, “Cyclic Redundancy Check Modification for Length
Detection of Message with Convolutional Protection,” US Patent: US 7,219,292
B2, May 15, 2007.

2.
S.-L. Shieh, S.-T. Kuo, P.-N.
Chen, and **Y. S. Han**, “System and
Method for Blind Transport Format Detection with Cyclic Redundancy Check,” US
Patent: US 7,716,554 B2, May 11, 2010.