Zhifang Zhang

Beibei Li

CoRR, 2024

Two-Insertion/Deletion/Substitution Correcting Codes.

[BibT_eX]

[DOI]

Yuhang Pi

CoRR, 2024

Improved Non-Asymptotic Lower Bound on the Size of Optimal Insertion/Deletion Correcting Code.

[BibT_eX]

[DOI]

Yuhang Pi

Proceedings of the IEEE International Symposium on Information Theory, 2024

A Family of Access-Friendly MDS Array Codes.

[BibT_eX]

[DOI]

Zhongyan Liu

Proceedings of the IEEE International Symposium on Information Theory, 2024

A Formula for the I/O Cost of Linear Repair Schemes and Application to Reed-Solomon Codes.

[BibT_eX]

[DOI]

Zhongyan Liu

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Bidirectional Piggybacking Design for All Nodes With Sub-Packetization 2 ≤ l ≤ r.

[BibT_eX]

[DOI]

Ke Wang

IEEE Trans. Commun., December, 2023

A novel combinatorial multi-armed bandit game to identify online the changing top-K flows in software-defined networks.

[BibT_eX]

[DOI]

Comput. Networks, July, 2023

A Vertical-Horizontal Framework for Building Rack-Aware Regenerating Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, May, 2023

Atrial Septal Defect Detection in Children Based on Ultrasound Video Using Multiple Instances Learning.

[BibT_eX]

[DOI]

CoRR, 2023

Bidirectional Piggybacking Design for All Nodes with Sub-Packetization l = r.

[BibT_eX]

[DOI]

Ke Wang

Proceedings of the IEEE Information Theory Workshop, 2023

Industry Session I: On Automotive Testing.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE Asian Test Symposium, 2023

2022

Rack-Aware Regenerating Codes With Multiple Erasure Tolerance.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2022

Explicit construction of minimum bandwidth rack-aware regenerating codes.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2022

2021

Rack-Aware Regenerating Codes with Fewer Helper Racks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Scalar MSCR Codes via the Product Matrix Construction.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Explicit Constructions of Optimal-Access MSCR Codes for All Parameters.

[BibT_eX]

[DOI]

Lu Wang

IEEE Commun. Lett., 2020

Numerical study on (<i>ω, Lδ</i>)-Lipschitz shadowing of stochastic differential equations.

[BibT_eX]

[DOI]

Qingyi Zhan

Xiangdong Xie

Appl. Math. Comput., 2020

Explicit Construction of Minimum Storage Rack-Aware Regenerating Codes for All Parameters.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

2019

The Optimal Sub-Packetization of Linear Capacity-Achieving PIR Schemes With Colluding Servers.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Bounds for Binary Linear Locally Repairable Codes via a Sphere-Packing Approach.

[BibT_eX]

[DOI]

Dongdai Lin

IEEE Trans. Inf. Theory, 2019

Numerical Study on Stochastic Diabetes Mellitus Model with Additive Noise.

[BibT_eX]

[DOI]

Qingyi Zhan

Xiangdong Xie

Comput. Math. Methods Medicine, 2019

A Capacity-Achieving T-PIR Scheme Based On MDS Array Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

An Improved Cooperative Repair Scheme for Reed-Solomon Codes.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Communications and Information Technologies, 2019

2018

On sub-packetization and access number of capacity-achieving PIR schemes for MDS coded non-colluding servers.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2018

Building Capacity-Achieving PIR Schemes with Optimal Sub-Packetization over Small Fields.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

On Sub-Packetization of Capacity-Achieving PIR Schemes for MDS Coded Databases.

[BibT_eX]

[DOI]

CoRR, 2017

Capacity-Achieving PIR Schemes with Optimal Sub-Packetization.

[BibT_eX]

[DOI]

CoRR, 2017

Bounds and constructions for linear locally repairable codes over binary fields.

[BibT_eX]

[DOI]

Dongdai Lin

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Two classes of (r, t)-locally repairable codes.

[BibT_eX]

[DOI]

Dongdai Lin

Proceedings of the IEEE International Symposium on Information Theory, 2016

Energy-Efficient Femtocells Active/Idle Control and Load Balancing in Heterogeneous Networks.

[BibT_eX]

[DOI]

Proceedings of the Communications and Networking, 2016

Energy-Efficient Resource Allocation in Distributed Antenna Systems.

[BibT_eX]

[DOI]

Proceedings of the Communications and Networking, 2016

2015

An Integer Programming-Based Bound for Locally Repairable Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Achieving Arbitrary Locality and Availability in Binary Codes.

[BibT_eX]

[DOI]

CoRR, 2015

Achieving arbitrary locality and availability in binary codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Repair Locality With Multiple Erasure Tolerance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Repair locality from a combinatorial perspective.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Rational secret sharing as extensive games.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2013

Exact cooperative regenerating codes with minimum-repair-bandwidth for distributed storage.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

2012

Threshold changeable secret sharing schemes revisited.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Network Coding Based on Chinese Remainder Theorem

[BibT_eX]

[DOI]

CoRR, 2012

2010

Unconditionally Secure Rational Secret Sharing in Standard Communication Networks.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Design and implementation of mesh-based current distribution on-line monitoring system in aluminum reduction cells.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Wireless Communications, 2010

Unconditionally Secure Rational Secret Sharing in Standard Communication Networks.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology - ICISC 2010, 2010

2008

Rearrangements of access structures and their realizations in secret sharing schemes.

[BibT_eX]

[DOI]

Discret. Math., 2008

Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

2007

Multiplicative Linear Secret Sharing Schemes Based on Connectivity of Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

2006

Linear multi-secret sharing schemes based on multi-party computation.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2006

2005

Statistical Multiparty Computation Based on Random Walks on Graphs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

Multiparty Computation Based on Connectivity of Graphs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes.

[BibT_eX]

[DOI]