( en | de | ru )

 

Disambiguation of "Cheng, Minquan"

Author of the publication

copydeleteadd this publication to your clipboard
Improved bounds on 2-frameproof codes with length 4.

, , and . Des. Codes Cryptogr., 87 (1): 97-106 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Minquan Zhang

Cheng-Yung Cheng

Ying Min Cheng

I-Fen Cheng

Xuerong Cheng

 

Other publications of authors with the same name

Multi-access Coded Caching with Optimal Rate and Linear Subpacketization under PDA and Consecutive Cyclic Placement., , and . CoRR, (2022)Freshness-Optimal Caching for Information Updating Systems with Limited Cache Storage Capacity., , and . CoRR, (2020)Improved bounds on 2-frameproof codes with length 4., , and . Des. Codes Cryptogr., 87 (1): 97-106 (2019)Combinatorial Properties of Multimedia IPP Codes of Length 2., , , and . DASC/PiCom/DataCom/CyberSciTech, page 930-935. IEEE, (2019)Reducing the Computational Complexity of the Reference-Sharing Based Self-embedding Watermarking Approach., , and . ICCCS (6), volume 11068 of Lecture Notes in Computer Science, page 635-643. Springer, (2018)On Exploiting Network Topology for Hierarchical Coded Multi-Task Learning., , , , , and . IEEE Trans. Commun., 72 (8): 4930-4944 (August 2024)Bounds and constructions for 3¯-strongly separable codes with length 3., , and . Cryptogr. Commun., 10 (3): 555-565 (2018)Reference Sharing Mechanism-Based Self-Embedding Watermarking Scheme with Deterministic Content Reconstruction., , , and . Secur. Commun. Networks, (2018)Regular (k, R, 1)-packings with $(R)=3$ and their locally repairable codes., and . Cryptogr. Commun., 12 (6): 1071-1089 (2020)Design of Placement Delivery Arrays for Coded Caching With Small Subpacketizations and Flexible Memory Sizes., , , and . IEEE Trans. Commun., 70 (11): 7089-7104 (2022)