Minquan Cheng
Southwest Jiaotong University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Minquan Cheng.
Journal of Computational Biology | 2014
Xun Wang; Ying Miao; Minquan Cheng
Motif finding problems, abstracted as the planted (l, d)-motif finding problem, are a major task in molecular biology--finding functioning units and genes. In 2002, the random projection algorithm was introduced to solve the challenging (15, 4)-motif finding problem by using randomly chosen templates. Two years later, a so-called uniform projection algorithm was developed to improve the random projection algorithm by means of low-dispersion sequences generated by coverings. In this article, we introduce an improved projection algorithm called the low-dispersion projection algorithm, which uses low-dispersion sequences generated by developed almost difference families. Compared with the random projection algorithm, the low-dispersion projection algorithm can solve the (l, d)-motif finding problem with fewer templates without decreasing the success rate.
IEEE Transactions on Information Theory | 2011
Minquan Cheng; Ying Miao
Multimedia fingerprinting is an effective technique to trace the sources of pirate copies of copyrighted multimedia information. AND anti-collusion codes can be used to construct fingerprints resistant to collusion attacks on multimedia contents. In this paper, we first investigate AND anti-collusion codes and related detection algorithms from a combinatorial viewpoint, and then introduce a new concept of logical anti-collusion code to improve the traceability of multimedia fingerprinting. It reveals that frameproof codes have traceability for multimedia contents. Relationships among anti-collusion codes and other structures related to fingerprinting are discussed, and constructions for both AND anti-collusion codes and logical anti-collusion codes are provided.
IEEE Transactions on Information Theory | 2012
Minquan Cheng; Lijun Ji; Ying Miao
Multimedia fingerprinting is an effective technique to trace the sources of pirate copies of copyrighted multimedia information. Separable codes can be used to construct fingerprints resistant to the averaging collusion attack on multimedia contents. In this paper, we investigate -separable codes from a combinatorial point of view. We first derive several upper bounds on the sizes of -separable codes, and then turn our attention to the constructions of optimal -separable codes with short length. Two infinite families of optimal -separable codes of length 2 are constructed from projective planes, and all optimal -separable codes of length 3 are explicitly constructed by means of difference matrices. These optimal -separable codes with short length can be used to construct good -separable codes with long length by a known composition construction.
Designs, Codes and Cryptography | 2015
Minquan Cheng; Hung-Lin Fu; Jing Jiang; Yuan-Hsun Lo; Ying Miao
Let
Designs, Codes and Cryptography | 2016
Jing Jiang; Minquan Cheng; Ying Miao
Cryptography and Communications | 2017
Minquan Cheng; Jing Jiang; Xiaohu Tang
\mathbb{C }
Cryptography and Communications | 2017
Minquan Cheng; Jing Jiang; Xiaohu Tang
Designs, Codes and Cryptography | 2018
Minquan Cheng; Jing Jiang; Qiang Wang
C be a code of length
Cryptography and Communications | 2017
Minquan Cheng; Jing Jiang; Xiaohu Tang
Archive | 2016
Minquan Cheng; Haiyan Li; Jing Jiang; Ying Miao; Xiaohua Tang
n