王成敏｜泰州学院｜学者主页

2025

Detecting arrays on graphs

Chengmin Wang, Ce Shi, Tatsuhiro Tsuchiya, Quanrui Zhang

Electronic Research Archive

DOI

2024

Separable detecting arrays

Ce Shi, Tatsuhiro Tsuchiya, Chengmin Wang

AIMS Mathematics

DOI

2022

A Construction for the Decomposition of Hypergraphs

Jie Yan, Chengmin Wang, Shan Lv

International Conference on Electronic Information Technology and Computer Engineering (EITCE)

DOI

2021

Upper Bounds and Constructions of Locating Arrays

Ce Shi, Jianfeng Fu, Chengmin Wang, Jie Yan

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

DOI

2020

Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions

Y. Chee, T. Etzion, Han Mao Kiah, A. Vardy, Chengmin Wang

Journal of combinatorial designs (Print)

DOI

2020

A Class of Optimal Cyclic Symbol-pair Codes from Combinatorial Designs

Jie Yan, Xiaofeng Xu, Chengmin Wang

Journal of Physics, Conference Series

DOI

2020

The Elias Type Upper Bound of Codes over Symbol-pair Read Channels

Jie Yan, Xiaofeng Xu, Chengmin Wang

2020 International Symposium on Computer Engineering and Intelligent Communications (ISCEIC)

DOI

2020

Bounds of Codes over Symbol-Pair Read Channels

Chengmin Wang

2020 International Conference on Computer Science and Engineering Technology (CSET2020)

DOI

2018

一类格子区组设计的存在性

王成敏，单金炘，严洁

《人工智能科学与工程》

DOI

2016

Resolvable generalized difference matrices: Existence and applications

Chengmin Wang, Jie Yan, Jianxing Yin

Finite Fields Their Appl.

DOI

2016

Optimum detecting arrays for independent interaction faults

Ce Shi, Chengmin Wang

Acta Mathematica Sinica. English series

DOI

2015

一类强对称自正交对角数独的存在性

邵旭彦，张勇，王成敏

《高校应用数学学报A辑》

2015

Orbit-disjoint regular (n, 3, 1)-CDPs and their applications to multilength OOCs

Jing-Jun Bao, L. Ji, Yang Li, Chengmin Wang

Finite Fields Their Appl.

DOI

2015

Some series of optimal multilength OOCs of weight four

Jing-Jun Bao, L. Ji, Yang Li, Chengmin Wang

Discrete Mathematics

DOI

2015

Existence of a family of strongly symmetric self-orthogonal diagonal Sudoku squares

Yong Zhang, Chengmin Wang, Xu-Yan Shao

DOI

2013

Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications

Y. Chee, Han Mao Kiah, A. C. H. Ling, Chengmin Wang

DOI

2013

The Existence of (K2 × K6)-Designs

Chengmin Wang, C. Colbourn

Graphs Comb.

DOI

2013

Doubly Resolvable Nearly Kirkman Triple Systems

R. Abel, Nigel H. N. Chan, C. Colbourn, E. Lamken, Chengmin Wang, Jin-Hua Wang

DOI

2013

Generalized Balanced Tournament Designs with Block Size Four

Y. Chee, Han Mao Kiah, Chengmin Wang

Electronic Journal of Combinatorics

DOI

2012

Cross-Bifix-Free Codes Within a Constant Factor of Optimality

Y. Chee, Han Mao Kiah, Punarbasu Purkayastha, Chengmin Wang

IEEE Transactions on Information Theory

DOI

2012

Importance of symbol equity in coded modulation for power line communications

Y. Chee, Han Mao Kiah, Punarbasu Purkayastha, Chengmin Wang

IEEE International Symposium on Information Theory. Proceedings

DOI

2012

Maximum Distance Separable Codes for Symbol-Pair Read Channels

Y. Chee, L. Ji, Han Mao Kiah, Chengmin Wang, Jianxing Yin

IEEE Transactions on Information Theory

DOI

2012

Optimal equitable symbol weight codes for power line communications

Y. Chee, Han Mao Kiah, Alan C. H. Ling, Chengmin Wang

IEEE International Symposium on Information Theory. Proceedings

DOI

2012

Trails of triples in partial triple systems

C. Colbourn, Daniel Horsley, Chengmin Wang

Des. Codes Cryptogr.

DOI

2012

The Existence of Near Generalized Balanced Tournament Designs

Chengmin Wang, Jie Yan

Electronic Journal of Combinatorics

DOI

2012

Maximum distance separable symbol-pair codes

Y. Chee, Han Mao Kiah, Chengmin Wang

IEEE International Symposium on Information Theory. Proceedings

DOI

2011

Mixed covering arrays of strength three with few factors

C. Colbourn, Ce Shi, Chengmin Wang, Jie Yan

DOI

2010

From a 1-Rotational RBIBD to a Partitioned Difference Family

M. Buratti, Jie Yan, Chengmin Wang

Electronic Journal of Combinatorics

DOI

2009

Bounds and Constructions on Optimal Constant Composition Codes

Chengmin Wang, Jie Yan

International Congress on Image and Signal Processing

DOI

2009

Kirkman covering designs with even-sized holes

Jianxing Yin, Chengmin Wang

Discrete Mathematics

DOI

2009

The Existence of FGDRP(3, gu)'s

Jie Yan, Chengmin Wang

Electronic Journal of Combinatorics

DOI

2009

Constructions of a Class of Partition Difference Family

Chengmin Wang, Jie Yan

2009 Third International Symposium on Intelligent Information Technology Application

DOI

2008

区组设计在编码中的应用

王成敏，檀朝红，严洁

《科技资讯》

2008

Generalized balanced tournament designs and related codes

Jianxing Yin, Jie Yan, Chengmin Wang

Des. Codes Cryptogr.

DOI

2008

Resolvable modified group divisible designs with higher index

P. Danziger, Chengmin Wang

The Australasian Journal of Combinatorics

2008

The Existence of a Class of HGBTDs

Xing-Bei Li, Chengmin Wang

2007

Resolvable modified group divisible designs with block size three

Chengmin Wang, Yu Tang, P. Danziger

DOI

精选作品

期刊论文

Detecting arrays on graphs

Separable detecting arrays

A Construction for the Decomposition of Hypergraphs

Upper Bounds and Constructions of Locating Arrays

Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions

A Class of Optimal Cyclic Symbol-pair Codes from Combinatorial Designs

The Elias Type Upper Bound of Codes over Symbol-pair Read Channels

Bounds of Codes over Symbol-Pair Read Channels

一类格子区组设计的存在性

Resolvable generalized difference matrices: Existence and applications

Optimum detecting arrays for independent interaction faults

一类强对称自正交对角数独的存在性

Orbit-disjoint regular (n, 3, 1)-CDPs and their applications to multilength OOCs

Some series of optimal multilength OOCs of weight four

Existence of a family of strongly symmetric self-orthogonal diagonal Sudoku squares

Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications

The Existence of (K2 × K6)-Designs

Doubly Resolvable Nearly Kirkman Triple Systems

Generalized Balanced Tournament Designs with Block Size Four

Cross-Bifix-Free Codes Within a Constant Factor of Optimality

Importance of symbol equity in coded modulation for power line communications

Maximum Distance Separable Codes for Symbol-Pair Read Channels

Optimal equitable symbol weight codes for power line communications

Trails of triples in partial triple systems

The Existence of Near Generalized Balanced Tournament Designs

Maximum distance separable symbol-pair codes

Mixed covering arrays of strength three with few factors

From a 1-Rotational RBIBD to a Partitioned Difference Family

Bounds and Constructions on Optimal Constant Composition Codes

Kirkman covering designs with even-sized holes

The Existence of FGDRP(3, gu)'s

Constructions of a Class of Partition Difference Family

区组设计在编码中的应用

Generalized balanced tournament designs and related codes

Resolvable modified group divisible designs with higher index

The Existence of a Class of HGBTDs

Resolvable modified group divisible designs with block size three

研究方向