- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j31 |      | Minquan Cheng, Lijun Ji, Ying Miao: Separable Codes. IEEE Transactions on Information Theory 58(3): 1791-1803 (2012) |
| 2011 | ||
| j30 | | Minquan Cheng, Ying Miao: On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting. IEEE Transactions on Information Theory 57(7): 4843-4851 (2011) |
| p1 | | Ryoh Fuji-Hara, Ying Miao: Multi-structured designs and their applications. Information Security, Coding Theory and Related Combinatorics 2011: 326-362 |
| 2010 | ||
| j29 | | Gennian Ge, Dawei Huang, Ying Miao: Monotonic Directed Designs. SIAM J. Discrete Math. 24(1): 218-238 (2010) |
| 2009 | ||
| j28 | | Gennian Ge, Ying Miao, Xiande Zhang: On Block Sequences of Steiner Quadruple Systems with Error Correcting Consecutive Unions. SIAM J. Discrete Math. 23(2): 940-958 (2009) |
| j27 | | Gennian Ge, Ying Miao, Zhongxiang Yao: Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties. IEEE Transactions on Information Theory 55(2): 867-879 (2009) |
| 2008 | ||
| j26 | | Ryoh Fuji-Hara, Xiyang Li, Ying Miao, Dianhua Wu: A TWOOA construction for multi-receiver multi-message authentication codes. J. Mathematical Cryptology 2(1): 9-28 (2008) |
| j25 | | Gennian Ge, Alan C. H. Ling, Ying Miao: A Systematic Construction for Radar Arrays. IEEE Transactions on Information Theory 54(1): 410-414 (2008) |
| 2007 | ||
| j24 | | Lihua Wang, Eiji Okamoto, Ying Miao, Takeshi Okamoto, Hiroshi Doi: An ID-SP-M4M Scheme and Its Security Analysis. IEICE Transactions 90-A(1): 91-100 (2007) |
| 2006 | ||
| j23 | | Gennian Ge, Ying Miao, L. Zhu: GOB designs for authentication codes with arbitration. Des. Codes Cryptography 40(3): 303-317 (2006) |
| j22 | | Zhenfu Cao, Gennian Ge, Ying Miao: Combinatorial characterizations of one-coincidence frequency-hopping sequences. Des. Codes Cryptography 41(2): 177-184 (2006) |
| j21 | | Lihua Wang, Zhenfu Cao, Takeshi Okamoto, Ying Miao, Eiji Okamoto: Authorization-Limited Transformation-Free Proxy Cryptosystems and Their Security Analyses. IEICE Transactions 89-A(1): 106-114 (2006) |
| j20 | | Gennian Ge, Ryoh Fuji-Hara, Ying Miao: Further combinatorial constructions for optimal frequency-hopping sequences. J. Comb. Theory, Ser. A 113(8): 1699-1718 (2006) |
| 2005 | ||
| j19 | | Gennian Ge, Ying Miao, Lihua Wang: Combinatorial Constructions for Optimal Splitting Authentication Codes. SIAM J. Discrete Math. 18(4): 663-678 (2005) |
| c2 | | Lihua Wang, Eiji Okamoto, Ying Miao, Takeshi Okamoto, Hiroshi Doi: ID-Based Series-Parallel Multisignature Schemes for Multi-Messages from Bilinear Maps. WCC 2005: 291-303 |
| i1 | | Raylin Tso, Ying Miao, Takeshi Okamoto, Eiji Okamoto: A Share-Correctable Protocol for the Shamir Threshold Scheme and Its Application to Participant Enrollment. IACR Cryptology ePrint Archive 2005: 239 (2005) |
| 2004 | ||
| j18 | | Ryoh Fuji-Hara, Ying Miao, Miwako Mishima: Optimal frequency hopping sequences: a combinatorial approach. IEEE Transactions on Information Theory 50(10): 2408-2420 (2004) |
| 2003 | ||
| j17 | | Yanxun Chang, Ying Miao: Constructions for optimal optical orthogonal codes. Discrete Mathematics 261(1-3): 127-139 (2003) |
| j16 | | Ying Miao: A combinatorial characterization of regular anonymous perfect threshold schemes. Inf. Process. Lett. 85(3): 131-135 (2003) |
| j15 | | Yanxun Chang, Ryoh Fuji-Hara, Ying Miao: Combinatorial constructions of optimal optical orthogonal codes with weight 4. IEEE Transactions on Information Theory 49(5): 1283-1292 (2003) |
| c1 | | Raylin Tso, Ying Miao, Eiji Okamoto: A New Algorithm for Searching a Consistent Set of Shares in a Threshold Scheme with Cheaters. ICISC 2003: 377-385 |
| 2002 | ||
| j14 |  | Yanxun Chang, Ying Miao: General Constructions for Double Group Divisible Designs and Double Frames. Des. Codes Cryptography 26(1-3): 155-168 (2002) |
| j13 | | Ryoh Fuji-Hara, Ying Miao: A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T, M, S)-Nets of Low Strength. Des. Codes Cryptography 26(1-3): 257-263 (2002) |
| j12 | | Ryoh Fuji-Hara, Sanpei Kageyama, Shinya Kuriki, Ying Miao, Shigenobu Shinohara: Balanced nested designs and balanced arrays. Discrete Mathematics 259(1-3): 91-119 (2002) |
| 2001 | ||
| j11 | | |
| j10 | | R. Julian R. Abel, Malcolm Greig, Ying Miao, Lie Zhu: Resolvable BIBDs with block size 7 and index 6. Discrete Mathematics 226(1-3): 1-20 (2001) |
| j9 | | Ryoh Fuji-Hara, Ying Miao, Jianxing Yin: Optimal (9v, 4, 1) Optical Orthogonal Codes. SIAM J. Discrete Math. 14(2): 256-266 (2001) |
| 2000 | ||
| j8 | | Clement W. H. Lam, Ying Miao: Cyclically resolvable cyclic Steiner triple systems of order 21 and 39. Discrete Mathematics 219(1-3): 173-185 (2000) |
| j7 | | Ryoh Fuji-Hara, Ying Miao: Optical orthogonal codes: Their bounds and new optimal constructions. IEEE Transactions on Information Theory 46(7): 2396-2406 (2000) |
| 1999 | ||
| j6 | | Ying Miao, Sanpei Kageyama: Two classes of q-ary codes based on group divisible association schemes. Discrete Mathematics 195(1-3): 269-276 (1999) |
| j5 | | Clement W. H. Lam, Ying Miao: On Cyclically Resolvable Cyclic Steiner 2-Designs. J. Comb. Theory, Ser. A 85(2): 194-207 (1999) |
| 1998 | ||
| j4 | | Sanpei Kageyama, Ying Miao: A Construction for Resolvable Designs and Its Generalizations. Graphs and Combinatorics 14(1): 11-24 (1998) |
| 1996 | ||
| j3 | | |
| j2 | | Sanpei Kageyama, Ying Miao: Some Non-embeddable Quasi-Derived Designs. J. Comb. Theory, Ser. A 76(2): 295-304 (1996) |
| 1994 | ||
| j1 | | Ying Miao: Existence of resolvable BIBDs with k = 5 and lambda = 4. Discrete Mathematics 128(1-3): 283-303 (1994) |
Data released under the ODC-BY 1.0 license — See also our legal information page