default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYing Miao 0001
Person information
- affiliation: University of Tsukuba, Faculty of Engineering, Information and Systems, Tsukuba, Japan
- affiliation (1997 - 1998): Concordia University, Department of Computer Science, Montreal, Canada
- affiliation (PhD 1997): Hiroshima University, Japan
- affiliation (1989 - 1993): Suzhou Institute of Silk Textile Technology, Suzhou, China
Other persons with the same name
- Ying Miao 0002
![[0000-0001-8285-4680]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-8285-4680")
— South China Agricultural University, College of Mathematics and Informatics, Guangzhou, China - Ying Miao 0004 — Qufu Normal University, School of Computer Science, Rizhao, China
- Ying Miao 0005 — Chinese Academy of Sciences, Academy of Opto-Electronics, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j61]Yujie Gu, Ilya Vorobyev, Ying Miao:
Secure Codes With List Decoding. IEEE Trans. Inf. Theory 70(4): 2430-2442 (2024)- [c11]Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang:
Repairing Schemes for Tamo-Barg Codes. ISIT 2024: 2140-2145 - [c10]Jinping Fan, Yujie Gu, Ying Miao, Zhebin Yu:
List-Decoding Separable Matrices for Non-Adaptive Combinatorial Group Testing. ISIT 2024: 3237-3242 - 2023
- [j60]Marcel Fernández, G. A. Kabatiansky, S. A. Kruglik, Ying Miao:
Codes for Exact Support Recovery of Sparse Vectors from Inaccurate Linear Measurements and Their Decoding. Probl. Inf. Transm. 59(1): 14-21 (2023) - [c9]Marcel Fernandez, Grigory Kabatiansky, Ibrahim Kamel, Ying Miao, Tamer F. Rabie:
Multimedia Fingerprinting Codes Resistant to Linear Attacks and Adversarial Noise. ISNCC 2023: 1-5 - [i18]Yujie Gu, Ilya Vorobyev, Ying Miao:
Secure Codes with List Decoding. CoRR abs/2302.02414 (2023) - [i17]Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang:
Repairing Schemes for Tamo-Barg Codes. CoRR abs/2312.12803 (2023) - 2022
- [j59]Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang:
A Construction of Maximally Recoverable Codes With Order-Optimal Field Size. IEEE Trans. Inf. Theory 68(1): 204-212 (2022) - [j58]Han Cai, Cuiling Fan, Ying Miao, Moshe Schwartz, Xiaohu Tang:
Optimal Locally Repairable Codes: An Improved Bound and Constructions. IEEE Trans. Inf. Theory 68(8): 5060-5074 (2022) - [j57]Yujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, Kouichi Sakurai:
On the Information-Theoretic Security of Combinatorial All-or-Nothing Transforms. IEEE Trans. Inf. Theory 68(10): 6904-6914 (2022) - [c8]Yujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, Kouichi Sakurai:
On the Security Properties of Combinatorial All-or-nothing Transforms. ISIT 2022: 1447-1452 - [c7]Yujie Gu, Ilya Vorobyev, Ying Miao:
Secure codes with list decoding. ISIT 2022: 2350-2355 - [i16]Yujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, Kouichi Sakurai:
On the Information-theoretic Security of Combinatorial All-or-nothing Transforms. CoRR abs/2202.10280 (2022) - 2021
- [j56]Minfeng Shao, Ying Miao:
Algebraic manipulation detection codes via highly nonlinear functions. Cryptogr. Commun. 13(1): 53-69 (2021) - [j55]Jinping Fan, Hung-Lin Fu, Yujie Gu, Ying Miao, Maiko Shigeno:
Strongly separable matrices for nonadaptive combinatorial group testing. Discret. Appl. Math. 291: 180-187 (2021) - [j54]Satoshi Noguchi, Xiao-Nan Lu, Masakazu Jimbo, Ying Miao:
BCH Codes with Minimum Distance Proportional to Code Length. SIAM J. Discret. Math. 35(1): 179-193 (2021) - [j53]Jinping Fan, Yujie Gu, Masahiro Hachimori, Ying Miao:
Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting. IEEE Trans. Inf. Theory 67(1): 200-216 (2021) - [j52]Jinbao Zhu, Qifa Yan, Xiaohu Tang, Ying Miao:
Capacity-Achieving Private Information Retrieval Schemes From Uncoded Storage Constrained Servers With Low Sub-Packetization. IEEE Trans. Inf. Theory 67(8): 5370-5386 (2021) - [c6]Han Cai, Cuiling Fan, Ying Miao, Moshe Schwartz, Xiaohu Tang:
An Improved Bound for Optimal Locally Repairable Codes. ISIT 2021: 3379-3384 - [i15]Jinbao Zhu, Qifa Yan, Xiaohu Tang, Ying Miao:
Capacity-Achieving Private Information Retrieval Schemes from Uncoded Storage Constrained Servers with Low Sub-packetization. CoRR abs/2102.08058 (2021) - 2020
- [j51]Minfeng Shao, Ying Miao:
On optimal weak algebraic manipulation detection codes and weighted external difference families. Des. Codes Cryptogr. 88(7): 1349-1369 (2020) - [j50]Yujie Gu, Jinping Fan, Ying Miao:
Improved Bounds for Separable Codes and B2 Codes. IEEE Commun. Lett. 24(1): 15-19 (2020) - [j49]Elena Egorova, Marcel Fernandez, Gregory A. Kabatiansky, Ying Miao:
Existence and Construction of Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise. Probl. Inf. Transm. 56(4): 388-398 (2020) - [j48]Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang:
On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets. IEEE Trans. Inf. Theory 66(4): 2402-2416 (2020) - [j47]Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang:
On Optimal Locally Repairable Codes With Super-Linear Length. IEEE Trans. Inf. Theory 66(8): 4853-4868 (2020) - [i14]E. Chen, Ying Miao, Yu Tang:
Median regression with differential privacy. CoRR abs/2006.02983 (2020) - [i13]Han Cai, Cuiling Fan, Ying Miao, Moshe Schwartz, Xiaohu Tang:
Optimal Locally Repairable Codes: An Improved Bound and Constructions. CoRR abs/2011.04966 (2020) - [i12]Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang:
A Construction of Maximally Recoverable Codes with Order-Optimal Field Size. CoRR abs/2011.13606 (2020)
2010 – 2019
- 2019
- [j46]Yujie Gu, Ying Miao:
Union-intersection-bounded families and their applications. Discret. Appl. Math. 266: 346-354 (2019) - [j45]Song Luo, Yuji Matsuura, Ying Miao, Maiko Shigeno:
Non-adaptive group testing on graphs with connectivity. J. Comb. Optim. 38(1): 278-291 (2019) - [j44]Yujie Gu, Minquan Cheng, Grigory Kabatiansky, Ying Miao:
Probabilistic Existence Results for Parent-Identifying Schemes. IEEE Trans. Inf. Theory 65(10): 6160-6170 (2019) - [c5]Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang:
On Optimal Locally Repairable Codes with Super-Linear Length. ISIT 2019: 2818-2822 - [i11]Minfeng Shao, Ying Miao:
On optimal weak algebraic manipulation detection codes and weighted external difference families. CoRR abs/1905.01412 (2019) - [i10]Jinping Fan, Yujie Gu, Masahiro Hachimori, Ying Miao:
Signature codes for weighted binary adder channel and multimedia fingerprinting. CoRR abs/1905.10180 (2019) - [i9]Yujie Gu, Minquan Cheng, Grigory Kabatiansky, Ying Miao:
Probabilistic Existence Results for Parent-Identifying Schemes. CoRR abs/1906.01031 (2019) - 2018
- [j43]Yujie Gu, Ying Miao:
Bounds on Traceability Schemes. IEEE Trans. Inf. Theory 64(5): 3450-3460 (2018) - [i8]Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang:
On Optimal Locally Repairable Codes with Super-Linear Length. CoRR abs/1812.11942 (2018) - 2017
- [j42]Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao:
Codes with the identifiable parent property for multimedia fingerprinting. Des. Codes Cryptogr. 83(1): 71-82 (2017) - [j41]Han Cai, Zhengchun Zhou, Xiaohu Tang, Ying Miao:
Zero-Difference Balanced Functions With New Parameters and Their Applications. IEEE Trans. Inf. Theory 63(7): 4379-4387 (2017) - [j40]Chong Shangguan, Xin Wang, Gennian Ge, Ying Miao:
New Bounds for Frameproof Codes. IEEE Trans. Inf. Theory 63(11): 7247-7252 (2017) - [c4]Raylin Tso, Ying Miao:
A Survey of Secret Sharing Schemes Based on Latin Squares. IIH-MSP (2) 2017: 267-272 - 2016
- [j39]Jing Jiang, Minquan Cheng, Ying Miao:
Strongly separable codes. Des. Codes Cryptogr. 79(2): 303-318 (2016) - [j38]Minquan Cheng, Jing Jiang, Haiyan Li, Ying Miao, Xiaohu Tang:
Bounds and constructions for 3¯-separable codes with length 3. Des. Codes Cryptogr. 81(2): 317-335 (2016) - [i7]Yujie Gu, Ying Miao:
Bounds on Traceability Schemes. CoRR abs/1609.08336 (2016) - 2015
- [j37]Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao:
New bounds on 2-separable codes of length 2. Des. Codes Cryptogr. 74(1): 31-40 (2015) - [i6]Minquan Cheng, Jing Jiang, Haiyan Li, Ying Miao, Xiaohu Tang:
Bounds and Constructions for $\overline{3}$-Separable Codes with Length 3. CoRR abs/1507.00954 (2015) - 2014
- [j36]Jingyuan Chen, Dianhua Wu, Ying Miao:
Bounds and constructions for (v, W, 2, Q)-OOCs. Discret. Math. 328: 16-22 (2014) - [j35]Xun Wang, Ying Miao, Minquan Cheng:
Finding Motifs in DNA Sequences Using Low-Dispersion Sequences. J. Comput. Biol. 21(4): 320-329 (2014) - [i5]Chong Shangguan, Xin Wang, Gennian Ge, Ying Miao:
New Bounds For Frameproof Codes. CoRR abs/1411.5782 (2014) - [i4]Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao:
Codes with the Identifiable Parent Property for Multimedia Fingerprinting. CoRR abs/1411.6784 (2014) - [i3]Jing Jiang, Minquan Cheng, Ying Miao, Dianhua Wu:
Multimedia IPP Codes with Efficient Tracing. CoRR abs/1411.6841 (2014) - [i2]Jing Jiang, Minquan Cheng, Ying Miao:
Strongly Separable Codes. CoRR abs/1412.6128 (2014) - 2012
- [j34]Minquan Cheng, Lijun Ji, Ying Miao:
Separable Codes. IEEE Trans. Inf. Theory 58(3): 1791-1803 (2012) - 2011
- [j33]Minquan Cheng, Ying Miao:
On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting. IEEE Trans. Inf. 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
- [j32]Gennian Ge, Dawei Huang, Ying Miao:
Monotonic Directed Designs. SIAM J. Discret. Math. 24(1): 218-238 (2010)
2000 – 2009
- 2009
- [j31]Gennian Ge, Ying Miao, Xiande Zhang:
On Block Sequences of Steiner Quadruple Systems with Error Correcting Consecutive Unions. SIAM J. Discret. Math. 23(2): 940-958 (2009) - [j30]Gennian Ge, Ying Miao, Zhongxiang Yao:
Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties. IEEE Trans. Inf. Theory 55(2): 867-879 (2009) - 2008
- [j29]Ryoh Fuji-Hara, Xiyang Li, Ying Miao, Dianhua Wu:
A TWOOA construction for multi-receiver multi-message authentication codes. J. Math. Cryptol. 2(1): 9-28 (2008) - [j28]Gennian Ge, Alan C. H. Ling, Ying Miao:
A Systematic Construction for Radar Arrays. IEEE Trans. Inf. Theory 54(1): 410-414 (2008) - 2007
- [j27]Lihua Wang, Eiji Okamoto, Ying Miao, Takeshi Okamoto, Hiroshi Doi:
An ID-SP-M4M Scheme and Its Security Analysis. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(1): 91-100 (2007) - 2006
- [j26]Gennian Ge, Ying Miao, Lie Zhu:
GOB designs for authentication codes with arbitration. Des. Codes Cryptogr. 40(3): 303-317 (2006) - [j25]Zhenfu Cao, Gennian Ge, Ying Miao:
Combinatorial characterizations of one-coincidence frequency-hopping sequences. Des. Codes Cryptogr. 41(2): 177-184 (2006) - [j24]Lihua Wang, Zhenfu Cao, Takeshi Okamoto, Ying Miao, Eiji Okamoto:
Authorization-Limited Transformation-Free Proxy Cryptosystems and Their Security Analyses. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(1): 106-114 (2006) - [j23]Raylin Tso, Ying Miao, Takeshi Okamoto, Eiji Okamoto:
How to Verify the Threshold t of Shamir's (t, n)-Threshold Scheme. Inf. Media Technol. 1(1): 102-111 (2006) - [j22]Raylin Tso, Ying Miao, Takeshi Okamoto, Eiji Okamoto:
A Share-Correctable Protocol for the Shamir Threshold Scheme and Its Application to Participant Enrollment. Inf. Media Technol. 1(1): 606-614 (2006) - [j21]Gennian Ge, Ryoh Fuji-Hara, Ying Miao:
Further combinatorial constructions for optimal frequency-hopping sequences. J. Comb. Theory A 113(8): 1699-1718 (2006) - 2005
- [j20]Gennian Ge, Ying Miao, Lihua Wang:
Combinatorial Constructions for Optimal Splitting Authentication Codes. SIAM J. Discret. Math. 18(4): 663-678 (2005) - [c3]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 Cryptol. ePrint Arch. 2005: 239 (2005) - 2004
- [j19]Ryoh Fuji-Hara, Ying Miao, Miwako Mishima:
Optimal frequency hopping sequences: a combinatorial approach. IEEE Trans. Inf. Theory 50(10): 2408-2420 (2004) - [c2]Lihua Wang, Zhenfu Cao, Eiji Okamoto, Ying Miao, Takeshi Okamoto:
Transformation-free proxy cryptosystems and their applications to electronic commerce. InfoSecu 2004: 92-98 - 2003
- [j18]Yanxun Chang, Ying Miao:
Constructions for optimal optical orthogonal codes. Discret. Math. 261(1-3): 127-139 (2003) - [j17]Ying Miao:
A combinatorial characterization of regular anonymous perfect threshold schemes. Inf. Process. Lett. 85(3): 131-135 (2003) - [j16]Yanxun Chang, Ryoh Fuji-Hara, Ying Miao:
Combinatorial constructions of optimal optical orthogonal codes with weight 4. IEEE Trans. Inf. 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
- [j15]Yanxun Chang, Ying Miao:
General Constructions for Double Group Divisible Designs and Double Frames. Des. Codes Cryptogr. 26(1-3): 155-168 (2002) - [j14]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 Cryptogr. 26(1-3): 257-263 (2002) - [j13]Ryoh Fuji-Hara, Sanpei Kageyama, Shinya Kuriki, Ying Miao, Shigenobu Shinohara:
Balanced nested designs and balanced arrays. Discret. Math. 259(1-3): 91-119 (2002) - 2001
- [j12]Clement W. H. Lam, Ying Miao:
Difference Families. Des. Codes Cryptogr. 24(3): 291-304 (2001) - [j11]R. Julian R. Abel, Malcolm Greig, Ying Miao, Lie Zhu:
Resolvable BIBDs with block size 7 and index 6. Discret. Math. 226(1-3): 1-20 (2001) - [j10]Ryoh Fuji-Hara, Ying Miao, Jianxing Yin:
Optimal (9v, 4, 1) Optical Orthogonal Codes. SIAM J. Discret. Math. 14(2): 256-266 (2001) - 2000
- [j9]Clement W. H. Lam, Ying Miao:
Cyclically resolvable cyclic Steiner triple systems of order 21 and 39. Discret. Math. 219(1-3): 173-185 (2000) - [j8]Ryoh Fuji-Hara, Ying Miao:
Optical orthogonal codes: Their bounds and new optimal constructions. IEEE Trans. Inf. Theory 46(7): 2396-2406 (2000)
1990 – 1999
- 1999
- [j7]Ying Miao, Sanpei Kageyama:
Two classes of q-ary codes based on group divisible association schemes. Discret. Math. 195(1-3): 269-276 (1999) - [j6]Clement W. H. Lam, Ying Miao:
On Cyclically Resolvable Cyclic Steiner 2-Designs. J. Comb. Theory A 85(2): 194-207 (1999) - 1998
- [j5]Miwako Mishima, Ying Miao, Sanpei Kageyama, Masakazu Jimbo:
Constructions of nested directed BIB designs. Australas. J Comb. 18: 157-172 (1998) - [j4]Sanpei Kageyama, Ying Miao:
A Construction for Resolvable Designs and Its Generalizations. Graphs Comb. 14(1): 11-24 (1998) - 1996
- [j3]Sanpei Kageyama, Ying Miao:
Some constructions of semiframes. Ars Comb. 43 (1996) - [j2]Sanpei Kageyama, Ying Miao:
Some Non-embeddable Quasi-Derived Designs. J. Comb. Theory A 76(2): 295-304 (1996) - 1994
- [j1]Ying Miao:
Existence of resolvable BIBDs with k = 5 and lambda = 4. Discret. Math. 128(1-3): 283-303 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
