| 2008 |
|---|
| 10 | EE | Jyh-Shyan Lin,
Jen-Chun Chang,
Rong-Jaye Chen,
Torleiv Kløve:
Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations.
IEEE Transactions on Information Theory 54(3): 1334-1339 (2008) |
| 2007 |
|---|
| 9 | EE | Jyh-Shyan Lin,
Jen-Chun Chang,
Rong-Jaye Chen,
Torleiv Kløve:
Distance preserving mappings from ternary vectors to permutations
CoRR abs/0704.1358: (2007) |
| 8 | EE | Jen-Chun Chang:
New Constructions of Distance-Increasing Mappings and Permutation Arrays.
J. Inf. Sci. Eng. 23(4): 1227-1239 (2007) |
| 2006 |
|---|
| 7 | EE | Jen-Chun Chang:
Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least two.
IEEE Transactions on Information Theory 52(4): 1683-1689 (2006) |
| 6 | EE | Jyh-Shyan Lin,
Jen-Chun Chang,
Rong-Jaye Chen:
New simple constructions of distance-increasing mappings from binary vectors to permutations.
Inf. Process. Lett. 100(2): 83-89 (2006) |
| 2005 |
|---|
| 5 | EE | Jen-Chun Chang:
Distance-increasing mappings from binary vectors to permutations.
IEEE Transactions on Information Theory 51(1): 359-363 (2005) |
| 4 | EE | Wanjiun Liao,
Jen-Chun Chang,
Victor O. K. Li:
Application-Layer conference trees for multimedia multipoint conferences using megaco/H.248.
IEEE Transactions on Multimedia 7(5): 951-959 (2005) |
| 2003 |
|---|
| 3 | | Jen-Chun Chang,
Rong-Jaye Chen,
Torleiv Kløve,
Shi-Chun Tsai:
Distance-preserving mappings from binary vectors to permutations.
IEEE Transactions on Information Theory 49(4): 1054-1059 (2003) |
| 2 | EE | Jen-Chun Chang,
Rong-Jaye Chen,
Frank K. Hwang:
An Efficient Algorithm for the Reliability of Consecutive-k-n Networks.
J. Inf. Sci. Eng. 19(1): 159-166 (2003) |
| 2001 |
|---|
| 1 | EE | Jen-Chun Chang,
Wanjiun Liao:
Application-Layer Conference Trees for Multimedia Multipoint Conferences Using Megaco/H.248.
ICME 2001 |
