| Optimal Locally Repairable Codes: An Improved Bound and Constructions | 1 | 0.35 | 2022 |
| A Construction of Maximally Recoverable Codes With Order-Optimal Field Size | 6 | 0.49 | 2022 |
| Bch Codes With Minimum Distance Proportional To Code Length | 0 | 0.34 | 2021 |
| Capacity-Achieving Private Information Retrieval Schemes from Uncoded Storage Constrained Servers with Low Sub-packetization | 0 | 0.34 | 2021 |
| A Privacy-Preserving Anime Recommendation Method on Distributed Platform. | 0 | 0.34 | 2021 |
| An Improved Bound For Optimal Locally Repairable Codes | 0 | 0.34 | 2021 |
| Strongly Separable Matrices For Nonadaptive Combinatorial Group Testing | 0 | 0.34 | 2021 |
| On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets | 0 | 0.34 | 2020 |
| Improved Bounds for Separable Codes and $B_2$ Codes | 0 | 0.34 | 2020 |
| On Optimal Locally Repairable Codes With Super-Linear Length | 5 | 0.40 | 2020 |
| Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting | 1 | 0.35 | 2019 |
| Signature Scheme from Trapdoor Functions. | 0 | 0.34 | 2019 |
| On optimal weak algebraic manipulation detection codes and weighted external difference families | 0 | 0.34 | 2019 |
| Union–intersection-bounded families and their applications | 1 | 0.35 | 2019 |
| Probabilistic Existence Results for Parent-Identifying Schemes. | 0 | 0.34 | 2019 |
| Non-adaptive group testing on graphs with connectivity | 0 | 0.34 | 2019 |
| Bounds on Traceability Schemes. | 3 | 0.41 | 2018 |
| On Optimal Locally Repairable Codes With Super-Linear Length | 0 | 0.34 | 2018 |
| Reliability design of battery management system for power battery. | 0 | 0.34 | 2018 |
| Zero-Difference Balanced Functions With New Parameters and Their Applications. | 5 | 0.41 | 2017 |
| Bounds and constructions for 3¯-separable codes with length 3. | 0 | 0.34 | 2016 |
| New bounds on 2 -separable codes of length 2 | 9 | 0.66 | 2015 |
| Bounds and Constructions for $\overline{3}$-Separable Codes with Length 3. | 0 | 0.34 | 2015 |
| Bounds and constructions for (v, W, 2, Q)-OOCs. | 0 | 0.34 | 2014 |
| Strongly Separable Codes. | 3 | 0.44 | 2014 |
| Multimedia IPP codes with efficient tracing | 1 | 0.38 | 2014 |
| Finding motifs in DNA sequences using low-dispersion sequences. | 25 | 1.54 | 2014 |
| New Bounds for Frameproof Codes | 7 | 0.58 | 2014 |
| Codes with the Identifiable Parent Property for Multimedia Fingerprinting. | 2 | 0.44 | 2014 |
| On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting | 19 | 1.00 | 2011 |
| Monotonic Directed Designs | 0 | 0.34 | 2010 |
| On Block Sequences of Steiner Quadruple Systems with Error Correcting Consecutive Unions | 0 | 0.34 | 2009 |
| Optimal frequency hopping sequences: auto- and cross-correlation properties | 69 | 2.17 | 2009 |
| A Systematic Construction for Radar Arrays | 3 | 0.45 | 2008 |
| A Twooa Construction For Multi-Receiver Multi-Message Authentication Codes | 1 | 0.36 | 2008 |
| An ID-SP-M4M Scheme and Its Security Analysis*A preliminary version was presented at WCC2005 [22]. | 6 | 0.44 | 2007 |
| An Id-Sp-M4m Scheme And Its Security Analysis | 2 | 0.38 | 2007 |
| Further combinatorial constructions for optimal frequency-hopping sequences | 47 | 2.49 | 2006 |
| Combinatorial characterizations of one-coincidence frequency-hopping sequences | 10 | 0.68 | 2006 |
| Authorization-Limited Transformation-Free Proxy Cryptosystems And Their Security Analyses | 6 | 0.56 | 2006 |
| Authorization-Limited Transformation-Free Proxy Cryptosystems and Their Security Analyses*A preliminary version was presented at InfoSecu'04 [13]. | 6 | 0.56 | 2006 |
| GOB designs for authentication codes with arbitration | 2 | 0.37 | 2006 |
| A Share-Correctable Protocol for the Shamir Threshold Scheme and Its Application to Participant Enrollment | 0 | 0.34 | 2005 |
| ID-Based series-parallel multisignature schemes for multi-messages from bilinear maps | 1 | 0.37 | 2005 |
| Combinatorial Constructions for Optimal Splitting Authentication Codes | 14 | 0.83 | 2005 |
| Optimal frequency hopping sequences: a combinatorial approach | 64 | 4.28 | 2004 |
| Combinatorial constructions of optimal optical orthogonal codes with weight 4 | 57 | 2.07 | 2003 |
| A combinatorial characterization of regular anonymous perfect threshold schemes | 2 | 0.39 | 2003 |
| Construction for optimal optical orthogonal codes | 51 | 2.46 | 2003 |
| A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (,,)-Nets of Low Strength | 1 | 0.38 | 2002 |
