Existence of resolvable BIBDs with k = 5 and lambda = 4. - Ying Miao 001 (Discret. Math., 1994)

Some constructions of semiframes. - Sanpei Kageyama; Ying Miao 001 (Ars Comb., 1996)

Some Non-embeddable Quasi-Derived Designs. - Sanpei Kageyama; Ying Miao 001 (J. Comb. Theory A, 1996)

Constructions of nested directed BIB designs. - Miwako Mishima; Ying Miao 001; Sanpei Kageyama; Masakazu Jimbo (Australas. J Comb., 1998)

A Construction for Resolvable Designs and Its Generalizations. - Sanpei Kageyama; Ying Miao 001 (Graphs Comb., 1998)

Two classes of q-ary codes based on group divisible association schemes. - Ying Miao 001; Sanpei Kageyama (Discret. Math., 1999)

On Cyclically Resolvable Cyclic Steiner 2-Designs. - Clement W. H. Lam; Ying Miao 001 (J. Comb. Theory A, 1999)

Cyclically resolvable cyclic Steiner triple systems of order 21 and 39. - Clement W. H. Lam; Ying Miao 001 (Discret. Math., 2000)

Optical orthogonal codes: Their bounds and new optimal constructions. - Ryoh Fuji-Hara; Ying Miao 001 (IEEE Trans. Inf. Theory, 2000)

Difference Families. - Clement W. H. Lam; Ying Miao 001 (Des. Codes Cryptogr., 2001)

Resolvable BIBDs with block size 7 and index 6. - R. Julian R. Abel; Malcolm Greig; Ying Miao 001; Lie Zhu (Discret. Math., 2001)

Optimal (9v, 4, 1) Optical Orthogonal Codes. - Ryoh Fuji-Hara; Ying Miao 001; Jianxing Yin (SIAM J. Discret. Math., 2001)

General Constructions for Double Group Divisible Designs and Double Frames. - Yanxun Chang; Ying Miao 001 (Des. Codes Cryptogr., 2002)

A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T, M, S)-Nets of Low Strength. - Ryoh Fuji-Hara; Ying Miao 001 (Des. Codes Cryptogr., 2002)

Balanced nested designs and balanced arrays. - Ryoh Fuji-Hara; Sanpei Kageyama; Shinya Kuriki; Ying Miao 001; Shigenobu Shinohara (Discret. Math., 2002)

A New Algorithm for Searching a Consistent Set of Shares in a Threshold Scheme with Cheaters. - Raylin Tso; Ying Miao 001; Eiji Okamoto (ICISC, 2003)

Constructions for optimal optical orthogonal codes. - Yanxun Chang; Ying Miao 001 (Discret. Math., 2003)

A combinatorial characterization of regular anonymous perfect threshold schemes. - Ying Miao 001 (Inf. Process. Lett., 2003)

Combinatorial constructions of optimal optical orthogonal codes with weight 4. - Yanxun Chang; Ryoh Fuji-Hara; Ying Miao 001 (IEEE Trans. Inf. Theory, 2003)

Transformation-free proxy cryptosystems and their applications to electronic commerce. - Lihua Wang 001; Zhenfu Cao; Eiji Okamoto; Ying Miao 001; Takeshi Okamoto (InfoSecu, 2004)

Optimal frequency hopping sequences: a combinatorial approach. - Ryoh Fuji-Hara; Ying Miao 001; Miwako Mishima (IEEE Trans. Inf. Theory, 2004)

ID-Based Series-Parallel Multisignature Schemes for Multi-Messages from Bilinear Maps. - Lihua Wang 001; Eiji Okamoto; Ying Miao 001; Takeshi Okamoto; Hiroshi Doi (WCC, 2005)

Combinatorial Constructions for Optimal Splitting Authentication Codes. - Gennian Ge; Ying Miao 001; Lihua Wang 001 (SIAM J. Discret. Math., 2005)

Combinatorial characterizations of one-coincidence frequency-hopping sequences. - Zhenfu Cao; Gennian Ge; Ying Miao 001 (Des. Codes Cryptogr., 2006)

GOB designs for authentication codes with arbitration. - Gennian Ge; Ying Miao 001; Lie Zhu (Des. Codes Cryptogr., 2006)

Authorization-Limited Transformation-Free Proxy Cryptosystems and Their Security Analyses. - Lihua Wang 001; Zhenfu Cao; Takeshi Okamoto; Ying Miao 001; Eiji Okamoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

How to Verify the Threshold t of Shamir's (t, n)-Threshold Scheme. - Raylin Tso; Ying Miao 001; Takeshi Okamoto; Eiji Okamoto (Inf. Media Technol., 2006)

A Share-Correctable Protocol for the Shamir Threshold Scheme and Its Application to Participant Enrollment. - Raylin Tso; Ying Miao 001; Takeshi Okamoto; Eiji Okamoto (Inf. Media Technol., 2006)

Further combinatorial constructions for optimal frequency-hopping sequences. - Gennian Ge; Ryoh Fuji-Hara; Ying Miao 001 (J. Comb. Theory A, 2006)

An ID-SP-M4M Scheme and Its Security Analysis. - Lihua Wang 001; Eiji Okamoto; Ying Miao 001; Takeshi Okamoto; Hiroshi Doi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007)

A TWOOA construction for multi-receiver multi-message authentication codes. - Ryoh Fuji-Hara; Xiyang Li; Ying Miao 001; Dianhua Wu (J. Math. Cryptol., 2008)

A Systematic Construction for Radar Arrays. - Gennian Ge; Alan C. H. Ling; Ying Miao 001 (IEEE Trans. Inf. Theory, 2008)

On Block Sequences of Steiner Quadruple Systems with Error Correcting Consecutive Unions. - Gennian Ge; Ying Miao 001; Xiande Zhang (SIAM J. Discret. Math., 2009)

Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties. - Gennian Ge; Ying Miao 001; Zhongxiang Yao (IEEE Trans. Inf. Theory, 2009)

Monotonic Directed Designs. - Gennian Ge; Dawei Huang; Ying Miao 001 (SIAM J. Discret. Math., 2010)

On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting. - Minquan Cheng; Ying Miao 001 (IEEE Trans. Inf. Theory, 2011)

Multi-structured designs and their applications. - Ryoh Fuji-Hara; Ying Miao 001 (Information Security, Coding Theory and Related Combinatorics, 2011)

Separable Codes. - Minquan Cheng; Lijun Ji; Ying Miao 001 (IEEE Trans. Inf. Theory, 2012)

Multimedia IPP Codes with Efficient Tracing. - Jing Jiang 003; Minquan Cheng; Ying Miao 001; Dianhua Wu (CoRR, 2014)

Bounds and constructions for (v, W, 2, Q)-OOCs. - Jingyuan Chen; Dianhua Wu; Ying Miao 001 (Discret. Math., 2014)

Finding Motifs in DNA Sequences Using Low-Dispersion Sequences. - Xun Wang 010; Ying Miao 001; Minquan Cheng (J. Comput. Biol., 2014)

Bounds and Constructions for $ overline{3}$-Separable Codes with Length 3. - Minquan Cheng; Jing Jiang 003; Haiyan Li; Ying Miao 001; Xiaohu Tang (CoRR, 2015)

New bounds on 2-separable codes of length 2. - Minquan Cheng; Hung-Lin Fu; Jing Jiang 003; Yuan-Hsun Lo; Ying Miao 001 (Des. Codes Cryptogr., 2015)

Bounds and constructions for 3¯-separable codes with length 3. - Minquan Cheng; Jing Jiang 003; Haiyan Li; Ying Miao 001; Xiaohu Tang (Des. Codes Cryptogr., 2016)

Strongly separable codes. - Jing Jiang 003; Minquan Cheng; Ying Miao 001 (Des. Codes Cryptogr., 2016)

A Survey of Secret Sharing Schemes Based on Latin Squares. - Raylin Tso; Ying Miao 001 (IIH-MSP (2), 2017)

Codes with the identifiable parent property for multimedia fingerprinting. - Minquan Cheng; Hung-Lin Fu; Jing Jiang 003; Yuan-Hsun Lo; Ying Miao 001 (Des. Codes Cryptogr., 2017)

Zero-Difference Balanced Functions With New Parameters and Their Applications. - Han Cai; Zhengchun Zhou; Xiaohu Tang; Ying Miao 001 (IEEE Trans. Inf. Theory, 2017)

New Bounds for Frameproof Codes. - Chong Shangguan; Xin Wang 065; Gennian Ge; Ying Miao 001 (IEEE Trans. Inf. Theory, 2017)

Bounds on Traceability Schemes. - Yujie Gu; Ying Miao 001 (IEEE Trans. Inf. Theory, 2018)

Union-intersection-bounded families and their applications. - Yujie Gu; Ying Miao 001 (Discret. Appl. Math., 2019)

Non-adaptive group testing on graphs with connectivity. - Song Luo; Yuji Matsuura; Ying Miao 001; Maiko Shigeno (J. Comb. Optim., 2019)

Probabilistic Existence Results for Parent-Identifying Schemes. - Yujie Gu; Minquan Cheng; Grigory Kabatiansky; Ying Miao 001 (IEEE Trans. Inf. Theory, 2019)

Median regression with differential privacy. - E. Chen; Ying Miao 001; Yu Tang (CoRR, 2020)

On optimal weak algebraic manipulation detection codes and weighted external difference families. - Minfeng Shao; Ying Miao 001 (Des. Codes Cryptogr., 2020)

Improved Bounds for Separable Codes and B2 Codes. - Yujie Gu; Jinping Fan; Ying Miao 001 (IEEE Commun. Lett., 2020)

Existence and Construction of Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise. - Elena Egorova; Marcel Fernandez; Gregory A. Kabatiansky; Ying Miao 001 (Probl. Inf. Transm., 2020)

On Optimal Locally Repairable Codes With Super-Linear Length. - Han Cai; Ying Miao 001; Moshe Schwartz 001; Xiaohu Tang (IEEE Trans. Inf. Theory, 2020)

On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets. - Han Cai; Ying Miao 001; Moshe Schwartz 001; Xiaohu Tang (IEEE Trans. Inf. Theory, 2020)

An Improved Bound for Optimal Locally Repairable Codes. - Han Cai; Cuiling Fan; Ying Miao 001; Moshe Schwartz 001; Xiaohu Tang (ISIT, 2021)

Algebraic manipulation detection codes via highly nonlinear functions. - Minfeng Shao; Ying Miao 001 (Cryptogr. Commun., 2021)

Strongly separable matrices for nonadaptive combinatorial group testing. - Jinping Fan; Hung-Lin Fu; Yujie Gu; Ying Miao 001; Maiko Shigeno (Discret. Appl. Math., 2021)

BCH Codes with Minimum Distance Proportional to Code Length. - Satoshi Noguchi; Xiao-Nan Lu; Masakazu Jimbo; Ying Miao 001 (SIAM J. Discret. Math., 2021)

Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting. - Jinping Fan; Yujie Gu; Masahiro Hachimori; Ying Miao 001 (IEEE Trans. Inf. Theory, 2021)

Capacity-Achieving Private Information Retrieval Schemes From Uncoded Storage Constrained Servers With Low Sub-Packetization. - Jinbao Zhu; Qifa Yan; Xiaohu Tang; Ying Miao 001 (IEEE Trans. Inf. Theory, 2021)

On the Security Properties of Combinatorial All-or-nothing Transforms. - Yujie Gu; Sonata Akao; Navid Nasr Esfahani; Ying Miao 001; Kouichi Sakurai (ISIT, 2022)

Optimal Locally Repairable Codes: An Improved Bound and Constructions. - Han Cai; Cuiling Fan; Ying Miao 001; Moshe Schwartz 001; Xiaohu Tang (IEEE Trans. Inf. Theory, 2022)

A Construction of Maximally Recoverable Codes With Order-Optimal Field Size. - Han Cai; Ying Miao 001; Moshe Schwartz 001; Xiaohu Tang (IEEE Trans. Inf. Theory, 2022)

On the Information-Theoretic Security of Combinatorial All-or-Nothing Transforms. - Yujie Gu; Sonata Akao; Navid Nasr Esfahani; Ying Miao 001; Kouichi Sakurai (IEEE Trans. Inf. Theory, 2022)

Multimedia Fingerprinting Codes Resistant to Linear Attacks and Adversarial Noise. - Marcel Fernandez; Grigory Kabatiansky; Ibrahim Kamel; Ying Miao 001; Tamer F. Rabie (ISNCC, 2023)

Codes for Exact Support Recovery of Sparse Vectors from Inaccurate Linear Measurements and Their Decoding. - Marcel Fernández; G. A. Kabatiansky; S. A. Kruglik; Ying Miao 001 (Probl. Inf. Transm., 2023)

List-Decoding Separable Matrices for Non-Adaptive Combinatorial Group Testing. - Jinping Fan; Yujie Gu; Ying Miao 001; Zhebin Yu (ISIT, 2024)

Existence and Algorithmic Construction of $q$-ary Secure Codes with List Decoding. - Ling Jiang; Yujie Gu; Jinping Fan; Ying Miao 001 (ITW, 2024)

Secure Codes With List Decoding. - Yujie Gu; Ilya Vorobyev; Ying Miao 001 (IEEE Trans. Inf. Theory, 2024)

Repairing Schemes for Tamo-Barg Codes. - Han Cai; Ying Miao 001; Moshe Schwartz 001; Xiaohu Tang (IEEE Trans. Inf. Theory, 2025)