Ying Miao

Entropy, 2024

Existence and Algorithmic Construction of $q$-ary Secure Codes with List Decoding.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2024

List-Decoding Separable Matrices for Non-Adaptive Combinatorial Group Testing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Repairing Schemes for Tamo-Barg Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Codes for Exact Support Recovery of Sparse Vectors from Inaccurate Linear Measurements and Their Decoding.

[BibT_eX]

[DOI]

Probl. Inf. Transm., January, 2023

Multimedia Fingerprinting Codes Resistant to Linear Attacks and Adversarial Noise.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Networks, Computers and Communications, 2023

2022

On the Information-Theoretic Security of Combinatorial All-or-Nothing Transforms.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

A Construction of Maximally Recoverable Codes With Order-Optimal Field Size.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Optimal Locally Repairable Codes: An Improved Bound and Constructions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Secure codes with list decoding.

[BibT_eX]

[DOI]

Ilya Vorobyev

Proceedings of the IEEE International Symposium on Information Theory, 2022

On the Security Properties of Combinatorial All-or-nothing Transforms.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Capacity-Achieving Private Information Retrieval Schemes From Uncoded Storage Constrained Servers With Low Sub-Packetization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

BCH Codes with Minimum Distance Proportional to Code Length.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Strongly separable matrices for nonadaptive combinatorial group testing.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Algebraic manipulation detection codes via highly nonlinear functions.

[BibT_eX]

[DOI]

Minfeng Shao

Cryptogr. Commun., 2021

An Improved Bound for Optimal Locally Repairable Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Existence and Construction of Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise.

[BibT_eX]

[DOI]

Elena Egorova

Marcel Fernandez

Gregory A. Kabatiansky

Probl. Inf. Transm., 2020

Improved Bounds for Separable Codes and B2 Codes.

[BibT_eX]

[DOI]

Jinping Fan

IEEE Commun. Lett., 2020

On optimal weak algebraic manipulation detection codes and weighted external difference families.

[BibT_eX]

[DOI]

Minfeng Shao

Des. Codes Cryptogr., 2020

Median regression with differential privacy.

[BibT_eX]

[DOI]

E. Chen

Yu Tang

CoRR, 2020

2019

Probabilistic Existence Results for Parent-Identifying Schemes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Non-adaptive group testing on graphs with connectivity.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Union-intersection-bounded families and their applications.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

On Optimal Locally Repairable Codes with Super-Linear Length.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Bounds on Traceability Schemes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

2017

New Bounds for Frameproof Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Zero-Difference Balanced Functions With New Parameters and Their Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Codes with the identifiable parent property for multimedia fingerprinting.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2017

A Survey of Secret Sharing Schemes Based on Latin Squares.

[BibT_eX]

[DOI]

Raylin Tso

Proceedings of the Advances in Intelligent Information Hiding and Multimedia Signal Processing, 2017

2016

Strongly separable codes.

[BibT_eX]

[DOI]

Jing Jiang

Des. Codes Cryptogr., 2016

Bounds and constructions for 3¯-separable codes with length 3.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2016

2015

New bounds on 2-separable codes of length 2.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

Bounds and Constructions for $\overline{3}$-Separable Codes with Length 3.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Finding Motifs in DNA Sequences Using Low-Dispersion Sequences.

[BibT_eX]

[DOI]

Xun Wang

J. Comput. Biol., 2014

Bounds and constructions for (v, W, 2, Q)-OOCs.

[BibT_eX]

[DOI]

Jingyuan Chen

Dianhua Wu

Discret. Math., 2014

Multimedia IPP Codes with Efficient Tracing.

[BibT_eX]

[DOI]

CoRR, 2014

2012

Separable Codes.

[BibT_eX]

[DOI]

Lijun Ji

IEEE Trans. Inf. Theory, 2012

2011

Multi-structured designs and their applications.

[BibT_eX]

[DOI]

Proceedings of the Information Security, Coding Theory and Related Combinatorics, 2011

On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

2010

Monotonic Directed Designs.

[BibT_eX]

[DOI]

Dawei Huang

SIAM J. Discret. Math., 2010

2009

Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties.

[BibT_eX]

[DOI]

Zhongxiang Yao

IEEE Trans. Inf. Theory, 2009

On Block Sequences of Steiner Quadruple Systems with Error Correcting Consecutive Unions.

[BibT_eX]

[DOI]

Xiande Zhang

SIAM J. Discret. Math., 2009

2008

A Systematic Construction for Radar Arrays.

[BibT_eX]

[DOI]

Alan C. H. Ling

IEEE Trans. Inf. Theory, 2008

A TWOOA construction for multi-receiver multi-message authentication codes.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2008

2007

An ID-SP-M4M Scheme and Its Security Analysis.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

2006

Further combinatorial constructions for optimal frequency-hopping sequences.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

A Share-Correctable Protocol for the Shamir Threshold Scheme and Its Application to Participant Enrollment.

[BibT_eX]

[DOI]

Inf. Media Technol., 2006

How to Verify the Threshold t of Shamir's (t, n)-Threshold Scheme.

[BibT_eX]

[DOI]

Inf. Media Technol., 2006

Authorization-Limited Transformation-Free Proxy Cryptosystems and Their Security Analyses.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

GOB designs for authentication codes with arbitration.

[BibT_eX]

[DOI]

Lie Zhu

Des. Codes Cryptogr., 2006

Combinatorial characterizations of one-coincidence frequency-hopping sequences.

[BibT_eX]

[DOI]

Zhenfu Cao

Des. Codes Cryptogr., 2006

2005

Combinatorial Constructions for Optimal Splitting Authentication Codes.

[BibT_eX]

[DOI]

Lihua Wang

SIAM J. Discret. Math., 2005

ID-Based Series-Parallel Multisignature Schemes for Multi-Messages from Bilinear Maps.

[BibT_eX]

[DOI]

Proceedings of the Coding and Cryptography, International Workshop, 2005

2004

Optimal frequency hopping sequences: a combinatorial approach.

[BibT_eX]

[DOI]

Miwako Mishima

IEEE Trans. Inf. Theory, 2004

Transformation-free proxy cryptosystems and their applications to electronic commerce.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Information Security, 2004

2003

Combinatorial constructions of optimal optical orthogonal codes with weight 4.

[BibT_eX]

[DOI]

Yanxun Chang

IEEE Trans. Inf. Theory, 2003

A combinatorial characterization of regular anonymous perfect threshold schemes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Constructions for optimal optical orthogonal codes.

[BibT_eX]

[DOI]

Yanxun Chang

Discret. Math., 2003

A New Algorithm for Searching a Consistent Set of Shares in a Threshold Scheme with Cheaters.

[BibT_eX]

[DOI]

Raylin Tso

Eiji Okamoto

Proceedings of the Information Security and Cryptology, 2003

2002

Balanced nested designs and balanced arrays.

[BibT_eX]

[DOI]

Discret. Math., 2002

A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T, M, S)-Nets of Low Strength.

[BibT_eX]

Des. Codes Cryptogr., 2002

General Constructions for Double Group Divisible Designs and Double Frames.

[BibT_eX]

Yanxun Chang

Des. Codes Cryptogr., 2002

2001

Optimal (9v, 4, 1) Optical Orthogonal Codes.

[BibT_eX]

[DOI]

Jianxing Yin

SIAM J. Discret. Math., 2001

Resolvable BIBDs with block size 7 and index 6.

[BibT_eX]

[DOI]

Discret. Math., 2001

Difference Families.

[BibT_eX]

Clement W. H. Lam

Des. Codes Cryptogr., 2001

2000

Optical orthogonal codes: Their bounds and new optimal constructions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Cyclically resolvable cyclic Steiner triple systems of order 21 and 39.

[BibT_eX]

[DOI]

Clement W. H. Lam

Discret. Math., 2000

1999

On Cyclically Resolvable Cyclic Steiner 2-Designs.

[BibT_eX]

[DOI]

Clement W. H. Lam

J. Comb. Theory A, 1999

Two classes of q-ary codes based on group divisible association schemes.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

A Construction for Resolvable Designs and Its Generalizations.

[BibT_eX]

[DOI]

Graphs Comb., 1998

Constructions of nested directed BIB designs.

[BibT_eX]

[DOI]

Australas. J Comb., 1998

1996

Some Non-embeddable Quasi-Derived Designs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1996

Some constructions of semiframes.

[BibT_eX]

Ars Comb., 1996

1994

Existence of resolvable BIBDs with k = 5 and lambda = 4.

[BibT_eX]

[DOI]