Yejing Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Yejing Wang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Rei Safavi-Naini
University of Wollongong
3 shared publications - Dongvu Tonien
Technology Research Institute, Wollongong, Australia
1 shared publication - Jennifer Seberry
University of Wollongong
1 shared publication - Luke McAven
University of Wollongong
1 shared publication - Ryoh Fuji-Hara
Faculty of Engineering, Information and Systems, University of Tsukuba, Tsukuba, Japan
1 shared publication
Latest Publications
- 1 January 2005
- Published by Taylor & Francis in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 8 (2) , 287-304
2-secure codes from 2-SFP codes
Secure code and secure frameproof code (SFP) are introduced to provide protection against illegal producing of copyrighted digital material. In this paper we present a general method of converting a binary 2-SFP code to a 2-secure code, that is providing a tracing algorithm and calculating ε, the chance of error in tracing. We express the error associated with this tracing in terms of n, the number of codewords in the code and d, the minimum Hamming distance of the code. We also characterize the set of pirate words such that the algorithm fails to trace. To illustrate the method, we first show that the dual Hamming code [6] is a 2-SFP code and we apply the proposed method for this code to obtain a 2-secure code.
- 1 January 2005
- Published by Taylor & Francis in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 8 (2) , 287-304
2-secure codes from 2-SFP codes
Secure code and secure frameproof code (SFP) are introduced to provide protection against illegal producing of copyrighted digital material. In this paper we present a general method of converting a binary 2-SFP code to a 2-secure code, that is providing a tracing algorithm and calculating ε, the chance of error in tracing. We express the error associated with this tracing in terms of n, the number of codewords in the code and d, the minimum Hamming distance of the code. We also characterize the set of pirate words such that the algorithm fails to trace. To illustrate the method, we first show that the dual Hamming code [6] is a 2-SFP code and we apply the proposed method for this code to obtain a 2-secure code.
- 1 January 2004
- Published by Springer Nature
- p. 345-358
Deletion Correcting Using Generalized Reed-Solomon Codes
- 1 January 2004
- Published by Springer Nature
- p. 345-358
Deletion Correcting Using Generalized Reed-Solomon Codes
- 31 May 2003
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 15, 225-227
A Note on the Exposure Property of SBIBD
- 31 May 2003
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 15, 225-227
A Note on the Exposure Property of SBIBD