Minquan Cheng

Orcid: 0000-0003-0360-0610

According to our database1, Minquan Cheng authored at least 94 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Coded Caching for Two-Dimensional Multi-Access Networks With Cyclic Wrap Around.
IEEE Trans. Inf. Theory, January, 2024

On Decentralized Linearly Separable Computation With the Minimum Computation Cost.
CoRR, 2024

2023
Placement Delivery Array Construction via Cartesian Product for Coded Caching.
IEEE Trans. Inf. Theory, December, 2023

Coded Caching Schemes for Two-Dimensional Caching-Aided Ultra-Dense Networks.
IEEE Trans. Commun., October, 2023

Multiple-Antenna Placement Delivery Array for Cache-Aided MISO Systems.
IEEE Trans. Inf. Theory, August, 2023

Design of Coded Caching Schemes With Linear Subpacketizations Based on Injective Arc Coloring of Regular Digraphs.
IEEE Trans. Commun., May, 2023

Multi-Access Coded Caching With Optimal Rate and Linear Subpacketization Under PDA and Consecutive Cyclic Placement.
IEEE Trans. Commun., 2023

Coded Caching Schemes for Multiaccess Topologies via Combinatorial Design.
CoRR, 2023

Coded Caching Scheme for Partially Connected Linear Networks Via Multi-antenna Placement Delivery Array.
CoRR, 2023

Cascaded Code Distributed Computing With Low Complexity and Improved Flexibility.
CoRR, 2023

Asymptotically Optimal Cascaded Coded Distributed Computing via Combinatorial Designs.
CoRR, 2023

Combinatorial Designs for Coded Caching on Hierarchical Networks.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2023

Coded Distributed Computing for Hierarchical Multi-task Learning.
Proceedings of the IEEE Information Theory Workshop, 2023

Coded Caching Design for Dynamic Networks with Reduced Subpacketizations.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Coded Caching Scheme for Two-Dimensional Caching-Aided Ultra-Dense Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Coded Caching Schemes for Multi-Access Topologies via Combinatorial Design Theory.
Proceedings of the IEEE International Symposium on Information Theory, 2023

A New Coded Caching Scheme via Cartesian Product Method.
Proceedings of the 8th International Conference on Computer and Communication Systems, 2023

2022
Design of Placement Delivery Arrays for Coded Caching With Small Subpacketizations and Flexible Memory Sizes.
IEEE Trans. Commun., 2022

On the Optimal Memory-Load Tradeoff of Coded Caching for Location-Based Content.
IEEE Trans. Commun., 2022

A novel centralized coded caching scheme for edge caching basestation.
J. Syst. Archit., 2022

Coded Caching for Combination Networks with Multiaccess.
Inf., 2022

Hierarchical Cache-Aided Linear Function Retrieval with Security and Privacy Constraints.
CoRR, 2022

Multi-access Coded Caching with Optimal Rate and Linear Subpacketization under PDA and Consecutive Cyclic Placement.
CoRR, 2022

Centralized Hierarchical Coded Caching Scheme Over Two-Layer Networks.
CoRR, 2022

A Lower Bound on Load of Coded Caching Schemes for Finite Subpacketizations.
Proceedings of the 20th International Symposium on Modeling and Optimization in Mobile, 2022

Multiple-antenna Placement Delivery Array with Cyclic Placement.
Proceedings of the 23rd IEEE International Workshop on Signal Processing Advances in Wireless Communication, 2022

Coded Caching for Two-Dimensional Multi-Access Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Multiple-antenna Placement Delivery Array for Cache-aided MISO Systems.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Design of Coded Caching Schemes through Proper Orthogonal Arrays.
Proceedings of the IEEE International Symposium on Information Theory, 2022

A Novel Framework for Coded Caching via Cartesian Product with Reduced Subpacketization.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Multiaccess Coded Caching with Private Demands.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Matroidal Entropy Functions: Constructions, Characterizations and Representations.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
An Approach to Reduce the Redundancy of Placement Delivery Array Schemes for Random Demands.
IEEE Wirel. Commun. Lett., 2021

A Framework of Constructing Placement Delivery Arrays for Centralized Coded Caching.
IEEE Trans. Inf. Theory, 2021

Linear Coded Caching Scheme for Centralized Networks.
IEEE Trans. Inf. Theory, 2021

Coded Caching Schemes With Linear Subpacketizations.
IEEE Trans. Commun., 2021

A Novel Transformation Approach of Shared-Link Coded Caching Schemes for Multiaccess Networks.
IEEE Trans. Commun., 2021

Multi-value private information retrieval with colluding databases via trace functions.
Inf. Sci., 2021

Matroidal Entropy Functions: A Quartet of Theories of Information, Matroid, Design, and Coding.
Entropy, 2021

On the Optimal Load-Memory Tradeoff of Coded Caching for Location-Based Content.
CoRR, 2021

Coded Caching for Combination Networks with Multiaccess.
CoRR, 2021

Novel Frameworks for Coded Caching via Cartesian Product with Reduced Subpacketization.
CoRR, 2021

A New Construction of PDA for Centralized Coded Caching Schemes.
Proceedings of the Computing, Communications and IoT Applications, ComComAp 2021, Shenzhen, 2021

2020
On the Dynamic Centralized Coded Caching Design.
IEEE Trans. Commun., 2020

Improved Constructions of Coded Caching Schemes for Combination Networks.
IEEE Trans. Commun., 2020

Some Variant of Known Coded Caching Schemes With Good Performance.
IEEE Trans. Commun., 2020

Placement Delivery Array Based on Concatenating Construction.
IEEE Commun. Lett., 2020

Multimedia IPP codes with efficient tracing.
Des. Codes Cryptogr., 2020

Freshness-Optimal Caching for Information Updating Systems with Limited Cache Storage Capacity.
CoRR, 2020

New coded caching schemes from placement delivery arrays.
CoRR, 2020

A Framework for Constructing Centralized Coded Caching Schemes via Hamming Distance.
CoRR, 2020

On Secure Coded Caching via Combinatorial Method.
CoRR, 2020

Regular (k, R, 1)-packings with $\max \limits {(R)}=3$ and their locally repairable codes.
Cryptogr. Commun., 2020

Improving Placement Delivery Array Coded Caching Schemes With Coded Placement.
IEEE Access, 2020

Some New Coded Caching Schemes With Smaller Subpacketization via Some Known Results.
IEEE Access, 2020

2019
Probabilistic Existence Results for Parent-Identifying Schemes.
IEEE Trans. Inf. Theory, 2019

Placement Delivery Array Design for Coded Caching Scheme in D2D Networks.
IEEE Trans. Commun., 2019

Constructions of Coded Caching Schemes With Flexible Memory Size.
IEEE Trans. Commun., 2019

A Generalized Grouping Scheme in Coded Caching.
IEEE Trans. Commun., 2019

Optimal Locally Repairable Systematic Codes Based on Packings.
IEEE Trans. Commun., 2019

Improved bounds on 2-frameproof codes with length 4.
Des. Codes Cryptogr., 2019

A Unified Framework for Constructing Centralized Coded Caching Schemes.
CoRR, 2019

The Advantages of Grouping Method for Repeated Requests in Coded Caching.
Proceedings of the Ninth International Workshop on Signal Design and its Applications in Communications, 2019

Combinatorial Properties of Multimedia IPP Codes of Length 2.
Proceedings of the 2019 IEEE Intl Conf on Dependable, 2019

2018
Enhanced Adaptive Network Coded Cooperation for Wireless Networks.
IEEE Trans. Veh. Technol., 2018

Reference Sharing Mechanism-Based Self-Embedding Watermarking Scheme with Deterministic Content Reconstruction.
Secur. Commun. Networks, 2018

Placement Delivery Array Design Through Strong Edge Coloring of Bipartite Graphs.
IEEE Commun. Lett., 2018

Improved rate for a multi-server coded caching.
CoRR, 2018

Bounds and constructions for 3¯-strongly separable codes with length 3.
Cryptogr. Commun., 2018

Reduced Transmission in Multi-server Coded Caching.
Proceedings of the Internet and Distributed Computing Systems, 2018

Reducing the Computational Complexity of the Reference-Sharing Based Self-embedding Watermarking Approach.
Proceedings of the Cloud Computing and Security - 4th International Conference, 2018

2017
On the Placement Delivery Array Design for Centralized Coded Caching Scheme.
IEEE Trans. Inf. Theory, 2017

Codes with the identifiable parent property for multimedia fingerprinting.
Des. Codes Cryptogr., 2017

A Novel Recursive Construction for Coded Caching Schemes.
CoRR, 2017

Coded caching schemes for Flexible Memory Sizes.
CoRR, 2017

Optimal Placement Delivery Arrays with Minimum Number of Rows.
CoRR, 2017

Asymptotically optimal 2¯-separable codes with length 4.
Cryptogr. Commun., 2017

2016
Strongly separable codes.
Des. Codes Cryptogr., 2016

Bounds and constructions for 3¯-separable codes with length 3.
Des. Codes Cryptogr., 2016

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

Optimal Placement Delivery Arrays.
CoRR, 2016

2015
New bounds on 2-separable codes of length 2.
Des. Codes Cryptogr., 2015

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

Self-Embedding Watermarking Scheme Based on MDS Codes.
Proceedings of the Digital-Forensics and Watermarking - 14th International Workshop, 2015

2014
Finding Motifs in DNA Sequences Using Low-Dispersion Sequences.
J. Comput. Biol., 2014

Multimedia IPP Codes with Efficient Tracing.
CoRR, 2014

2013
Perfect difference families and related variable-weight optical orthogonal codes.
Australas. J Comb., 2013

2012
Separable Codes.
IEEE Trans. Inf. Theory, 2012

2011
On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting.
IEEE Trans. Inf. Theory, 2011

Relative Difference Families With Variable Block Sizes and Their Related OOCs.
IEEE Trans. Inf. Theory, 2011

A note on balanced (q, {3, 4}, λ)-DFs with q a prime power.
Australas. J Comb., 2011

2010
New Classes of Optimal Variable-Weight Optical Orthogonal Codes Based on Cyclic Difference Families.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

The existence of balanced (<i>υ</i>, {3, 6}, 1) difference families.
Sci. China Inf. Sci., 2010

2008
A note on the existence of balanced (q, {3, 4}, 1) difference families.
Australas. J Comb., 2008


  Loading...