The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tien-Ke Huang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jay Cheng, Tien-Ke Huang
    New Lower and Upper Bounds on the Expected Length of Optimal One-to-One Codes. [Citation Graph (0, 0)][DBLP]
    DCC, 2006, pp:43-52 [Conf]
  2. Jay Cheng, Tien-Ke Huang, Claudio Weidmann
    New Bounds on the Expected Length of Optimal One-to-One Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:5, pp:1884-1895 [Journal]
  3. Jay Cheng, Tien-Ke Huang
    Upper bounds on exponentiated expected length of optimal one-to-one codes. [Citation Graph (0, 0)][DBLP]
    IWCMC, 2006, pp:1207-1212 [Conf]

  4. A Bit-Stuffing Algorithm for Crosstalk Avoidance in High Speed Switching. [Citation Graph (, )][DBLP]


Search in 0.014secs, Finished in 0.015secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002