New Lower and Upper Bounds on the Expected Length of Optimal One-to-One Codes. - Jay Cheng; Tien-Ke Huang (DCC, 2006)

Upper bounds on exponentiated expected length of optimal one-to-one codes. - Jay Cheng; Tien-Ke Huang (IWCMC, 2006)

New Bounds on the Expected Length of Optimal One-to-One Codes. - Jay Cheng; Tien-Ke Huang; Claudio Weidmann (IEEE Trans. Inf. Theory, 2007)

A Bit-Stuffing Algorithm for Crosstalk Avoidance in High Speed Switching. - Cheng-Shang Chang; Jay Cheng; Tien-Ke Huang; Xuan-Chao Huang; Duan-Shin Lee (INFOCOM, 2010)

Constructions of Memoryless Crosstalk Avoidance Codes Via ${ cal C}$ -Transform. - Cheng-Shang Chang; Jay Cheng; Tien-Ke Huang; Duan-Shin Lee (IEEE Trans. Very Large Scale Integr. Syst., 2014)

Bit-Stuffing Algorithms for Crosstalk Avoidance in High-Speed Switching. - Cheng-Shang Chang; Jay Cheng; Tien-Ke Huang; Xuan-Chao Huang; Duan-Shin Lee; Chao-Yi Chen (IEEE Trans. Computers, 2015)

Coding Rate Analysis of Forbidden Overlap Codes in High-Speed Buses. - Cheng-Shang Chang; Jay Cheng; Tien-Ke Huang; Duan-Shin Lee; Cheng-Yu Chen (ACM Trans. Model. Perform. Evaluation Comput. Syst., 2016)