Search the dblp DataBase
Ying Miao :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Raylin Tso , Ying Miao , Eiji Okamoto A New Algorithm for Searching a Consistent Set of Shares in a Threshold Scheme with Cheaters. [Citation Graph (0, 0)][DBLP ] ICISC, 2003, pp:377-385 [Conf ] Lihua Wang , Eiji Okamoto , Ying Miao , Takeshi Okamoto , Hiroshi Doi ID-Based Series-Parallel Multisignature Schemes for Multi-Messages from Bilinear Maps. [Citation Graph (0, 0)][DBLP ] WCC, 2005, pp:291-303 [Conf ] Sanpei Kageyama , Ying Miao Some constructions of semiframes. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1996, v:43, n:, pp:- [Journal ] Yanxun Chang , Ying Miao General Constructions for Double Group Divisible Designs and Double Frames. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2002, v:26, n:1-3, pp:155-168 [Journal ] Ryoh Fuji-Hara , Ying Miao A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T, M, S)-Nets of Low Strength. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2002, v:26, n:1-3, pp:257-263 [Journal ] Clement W. H. Lam , Ying Miao Difference Families. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2001, v:24, n:3, pp:291-304 [Journal ] Gennian Ge , Ying Miao , L. Zhu GOB designs for authentication codes with arbitration. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2006, v:40, n:3, pp:303-317 [Journal ] Zhenfu Cao , Gennian Ge , Ying Miao Combinatorial characterizations of one-coincidence frequency-hopping sequences. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2006, v:41, n:2, pp:177-184 [Journal ] R. Julian R. Abel , Malcolm Greig , Ying Miao , Lie Zhu Resolvable BIBDs with block size 7 and index 6. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:226, n:1-3, pp:1-20 [Journal ] Yanxun Chang , Ying Miao Constructions for optimal optical orthogonal codes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:261, n:1-3, pp:127-139 [Journal ] Ryoh Fuji-Hara , Sanpei Kageyama , Shinya Kuriki , Ying Miao , Shigenobu Shinohara Balanced nested designs and balanced arrays. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:259, n:1-3, pp:91-119 [Journal ] Clement W. H. Lam , Ying Miao Cyclically resolvable cyclic Steiner triple systems of order 21 and 39. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2000, v:219, n:1-3, pp:173-185 [Journal ] Ying Miao A combinatorial characterization of regular anonymous perfect threshold schemes. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2003, v:85, n:3, pp:131-135 [Journal ] Sanpei Kageyama , Ying Miao Some Non-embeddable Quasi-Derived Designs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1996, v:76, n:2, pp:295-304 [Journal ] Clement W. H. Lam , Ying Miao On Cyclically Resolvable Cyclic Steiner 2-Designs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1999, v:85, n:2, pp:194-207 [Journal ] Gennian Ge , Ryoh Fuji-Hara , Ying Miao Further combinatorial constructions for optimal frequency-hopping sequences. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2006, v:113, n:8, pp:1699-1718 [Journal ] Ryoh Fuji-Hara , Ying Miao , Jianxing Yin Optimal (9v , 4, 1) Optical Orthogonal Codes. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2001, v:14, n:2, pp:256-266 [Journal ] Gennian Ge , Ying Miao , Lihua Wang Combinatorial Constructions for Optimal Splitting Authentication Codes. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2005, v:18, n:4, pp:663-678 [Journal ] Yanxun Chang , Ryoh Fuji-Hara , Ying Miao Combinatorial constructions of optimal optical orthogonal codes with weight 4. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2003, v:49, n:5, pp:1283-1292 [Journal ] Ryoh Fuji-Hara , Ying Miao Optical orthogonal codes: Their bounds and new optimal constructions. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2396-2406 [Journal ] Ryoh Fuji-Hara , Ying Miao , Miwako Mishima Optimal frequency hopping sequences: a combinatorial approach. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2004, v:50, n:10, pp:2408-2420 [Journal ] Ying Miao , Sanpei Kageyama Two classes of q-ary codes based on group divisible association schemes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1999, v:195, n:1-3, pp:269-276 [Journal ] Ying Miao Existence of resolvable BIBDs with k = 5 and lambda = 4. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1994, v:128, n:1-3, pp:283-303 [Journal ] Search in 0.004secs, Finished in 0.005secs