#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1990

2018

- This year (0)
- Last 5 years (12)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jen-Chun Chang
- IEEE Transactions on Information Theory
- 2005

In this correspondence, for any k ges 2, we first propose two constructions of (n,k) distance-increasing mappings (DIMs) from the set of binary vectors of length n to the set of permutations of the… (More)

- Jen-Chun Chang, Yi-Zhi Lu, Hsin-Lung Wu
- Signal Processing
- 2017

In this paper, we construct a separable reversible data hiding scheme for encrypted JPEG bitstreams. Our proposed scheme is constructed via a reserving-room-before-encryption manner, that is, the… (More)

- Jyh-Shyan Lin, Jen-Chun Chang, Rong-Jaye Chen, Torleiv Kløve
- IEEE Transactions on Information Theory
- 2008

Permutation arrays have found applications in powerline communication. One construction method for permutation arrays is to map good codes to permutations using a distance-preserving mappings (DPM).… (More)

- Jen-Chun Chang, Hsin-Lung Wu
- Fifth International Conference on Intelligent…
- 2009

We study the problem how to construct an RFID mutual authentication protocol between tags and readers. Juels (in Journal on Selected Areas in Communications, 2006) proposed an open question which… (More)

- Jen-Chun Chang
- 2006

Mappings from the set of binary vectors of a fixed length to the set of permutations of the same length that strictly increase Hamming distances are useful for the construction of permutation codes… (More)

An O(T n) algorithm is presented for the circular consecutive-weighted-k-out-of-n:F system, where T/spl les/min[n,[(k-/spl omega//sub max/)//spl omega//sub min/]+1]; /spl omega//sub max/, /spl… (More)

Zuo claimed that the comparison of Birnbaum importance between two components for a consecutive-k-out-of-n:G system is the same as that for the F-system. We show that this is not the case and give a… (More)

- Jyh-Shyan Lin, Jen-Chun Chang, Rong-Jaye Chen
- Inf. Process. Lett.
- 2006

Distance-increasing mappings (DIMs) are mappings from the set of binary vectors of a fixed length to the set of permutations of the same length that increase Hamming distances except when that is… (More)

- Wei-Chin Ku, Te-Chih Chou, Hsin-Lung Wu, Jen-Chun Chang
- Fourth International Conference on Genetic and…
- 2010

In this paper, we develop a watermarking scheme for image authentication and verification. The watermarking scheme for tamper detection of an image is fragile and block-based. Such a scheme has good… (More)

- Jyh-Shyan Lin, Jen-Chun Chang, Rong-Jaye Chen, Torleiv Kløve
- IEEE Trans. Information Theory
- 2003

Distance-preserving mappings (DPMs) are mappings from the set of all q-ary vectors of a fixed length to the set of permutations of the same or longer length such that every two distinct vectors are… (More)