![]() | ![]() |
| 2010 | ||
|---|---|---|
| 4 | Cheng-Shang Chang, Jay Cheng, Tien-Ke Huang, Xuan-Chao Huang, Duan-Shin Lee: A Bit-Stuffing Algorithm for Crosstalk Avoidance in High Speed Switching. INFOCOM 2010: 839-847 | |
| 2007 | ||
| 3 | Jay Cheng, Tien-Ke Huang, Claudio Weidmann: New Bounds on the Expected Length of Optimal One-to-One Codes. IEEE Transactions on Information Theory 53(5): 1884-1895 (2007) | |
| 2006 | ||
| 2 | Jay Cheng, Tien-Ke Huang: New Lower and Upper Bounds on the Expected Length of Optimal One-to-One Codes. DCC 2006: 43-52 | |
| 1 | Jay Cheng, Tien-Ke Huang: Upper bounds on exponentiated expected length of optimal one-to-one codes. IWCMC 2006: 1207-1212 | |
| 1 | Cheng-Shang Chang | [4] |
| 2 | Jay Cheng | [1] [2] [3] [4] |
| 3 | Xuan-Chao Huang | [4] |
| 4 | Duan-Shin Lee | [4] |
| 5 | Claudio Weidmann | [3] |
Data released under the ODC-BY 1.0 license — See also our legal information page