繆 瑩(ミャオ イン)
- 論文
- A combinatorial characterization of regular anonymous perfect threshold schemes
Y. Miao
Information Processing Letters/85/p.131-135, 2003-01 - Constructions for optimal optical orthogonal codes
Y. Chang; Y. Miao
Discrete Mathematics/261/p.127-139, 2003-01 - A note on geometric structures of linear ordered orthogonal arrays and (T,M,S)-nets of low strength
R. Fuji-Hara; Y. Miao
Designs, Codes and Cryptography/26/p.257-263, 2002-06 - General constructions for double group divisible designs and double frames
Y. Chang; Y. Miao
Designs, Codes and Cryptography/26/p.155-168, 2002-06 - Complete sets of disjoint difference families and their applications
R. Fuji-Hara; Y. Miao; S. Shinohara
Journal of Statistical Planning and Inference/106/p.87-103, 2002-01 - Frames with block size four and index three
S. Furino; S. Kageyama; A. C. H. Ling; Y. Miao; J. Yin
Journal of Statistical Planning and Inference/106/p.117-124, 2002-01 - Balanced nested designs and n-ary designs
R. Fuji-Hara; S. Kuriki; Y. Miao; S. Shinohara
Journal of Statistical Planning and Inference/106/p.57-67, 2002-01 - Balanced nested designs and balanced arrays
R. Fuji-Hara; S. Kageyama; S. Kuriki; Y. Miao; S. Shinohara
Discrete Mathematics/259/p.91-119, 2002-01 - (C \oplus G,k,lambda) difference families
C. Lam; Y. Miao
Designs, Codes, and Cryptography/24/p.291-304, 2001-12 - Resolvable BIBDs with block size 7 and index 6
R. J. R. Abel; M. Greig; Y. Miao; L. Zhu
Discrete Mathematics/226/p.1-20, 2001-01 - Directed B(K,1;v) with K = {4,5} and {4,6} related to deletion/insertion-correcting codes
R. Fuji-Hara; Y. Miao; J. Wang; J. Yin
Journal of Combinatorial Designs/9/p.147-156, 2001-01 - Cyclically resolvable cyclic Steiner 2-systems S(2,4,52)
C. Lam; Y. Miao; M. Mishima
Journal of Statistical Planning and Inference/95/p.245-256, 2001-01 - Existence of nested designs with block size five
S. Kageyama; Y. Miao
Journal of Statistical Planning and Inference/94/p.249-254, 2001-01 - Optimal (9v,4,1) optical orthogonal codes
R. Fuji-Hara; Y. Miao; J. Yin
SIAM Journal on Discrete Mathematics/14/p.256-266, 2001-01 - Constructions for rotational near resolvable block designs
R. J. R. Abel; M. Buratti; M. Greig; Y. Miao
Journal of Combinatorial Designs/9/p.157-181, 2001-01 - Optical orthogonal codes: their bounds and new optimal constructions
R. Fuji-Hara; Y. Miao
IEEE Transactions on Information Theory/46/p.2396-2406, 2000-11 - Optical orthogonal codes derived from difference triangle sets
S. Kageyama; Y. Miao
Congressus Numerantium/143/p.129-139, 2000-01 - Cyclically resolvable cyclic Steiner triple systems of order 21 and 39
C. Lam; Y. Miao
Discrete Mathematics/219/p.173-185, 2000-01 - On cyclically resolvable cyclic Steiner 2-designs
C. Lam; Y. Miao
Journal of Combinatorial Theory, Series A/85/p.194-207, 1999-02 - Two classes of q-ary codes based on group divisible association schemes
Y. Miao; S. Kageyama
Discrete Mathematics/195/p.269-276, 1999-01 - On nested group divisible designs with block size three or four
S. Kageyama; Y. Miao
Combinatorics, Graph Theory, and Algorithms/II/p.515-525, 1999-01 - Nested designs of superblock size four
S. Kageyama; Y. Miao
Journal of Statistical Planning and Inference/73/p.1-5, 1998-01 - How to nest a perfect Mendelsohn design with block size three or four
S. Kageyama; Y. Miao
Journal of Combinatorics, Information & System Sciences/23/p.125-133, 1998-01 - Constructions of nested directed BIB designs
M. Mishima; Y. Miao; S. Kageyama; M. Jimbo
The Australasian Journal of Combinatorics/18/p.157-172, 1998-01 - A construction for resolvable designs and its generalizations
S. Kageyama; Y. Miao
Graphs and Combinatorics/14/p.11-24, 1998-01 - さらに表示...
- A combinatorial characterization of regular anonymous perfect threshold schemes