# Jianmin Wang

• IEEE Transactions on Information Theory
• 2010
A <i>(n</i>x<i>m</i>, <i>k</i>, ¿) two-dimensional optical orthogonal code (2-D OOC), <i>C</i>, is a family of <i>n</i>x<i>m</i> (0, 1)-arrays of constant weight <i>k</i> such that <i>¿i</i>=1<i>n</i>¿<i>j</i>=0<i>m</i>-1<i>A</i>(<i>i</i>, <i>j</i>)<i>B</i>(<i>i</i>, <i>j</i>¿<i>m</i>¿) ¿ ¿ for any arrays <i>A</i>, <i>B</i> in <i>C</i> and any integer(More)
There are two kinds of perfect t-deletion-correcting codes of length k over an alphabet of size v, those where the coordinates may be equal and those where all coordinates must be different. We call these two kinds of codes T ∗(k − t, k, v)-codes and T (k − t, k, v)codes respectively. The cardinality of a T (k − t, k, v)-code is determined by its(More)
• 1
• Des. Codes Cryptography
• 2009
The notion of a grid holey packing (GHP) was first proposed for the construction of constant composite codes. For a GHP (k, 1; n × g) of type [w1, . . . , wg], where k = ∑g j=1w j , the fundamental problem is to determine the packing number N ([w1, . . . , wg], 1; n × g), that is, the maximum number of blocks in such a GHP. In this paper we determine(More)
• IEEE Transactions on Information Theory
• 2006
There are two kinds of perfect (k-t)-deletion-correcting codes with words of length k over an alphabet of size v, those where the coordinates may be equal and those where all coordinates must be different. We call these two kinds of codes T*(t,k,v)-codes and T(t,k,v)-codes respectively. Both a T*(t,k,v)-code and a T(t,k,v)-code are capable of correcting any(More)
• Des. Codes Cryptography
• 2015
A q-ary code of length n is termed an equitable symbol weight code, if each symbol appears among the coordinates of every codeword either n/q or n/q times. This class of codes was proposed recently by Chee et al. in order to more precisely capture a code’s performance against permanent narrowband noise in power line communication. In this paper, two series(More)
• 1