default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhifang Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j22]Zhongyan Liu
, Zhifang Zhang:
A Formula for the I/O Cost of Linear Repair Schemes and Application to Reed-Solomon Codes. IEEE Trans. Commun. 73(1): 67-76 (2025)- [i28]Zongyu Wu, Yuwei Niu, Hongcheng Gao, Minhua Lin, Zhiwei Zhang, Zhifang Zhang, Qi Shi, Yilong Wang, Sike Fu, Junjie Xu, Junjie Ao, Enyan Dai, Lei Feng, Xiang Zhang, Suhang Wang:
LanP: Rethinking the Impact of Language Priors in Large Vision-Language Models. CoRR abs/2502.12359 (2025) - 2024
- [j21]Yiman Liu, Xiaoxiang Han, Tongtong Liang, Lijun Chen, Bin Dong, Jiajun Yuan, Hansong Wang, Zhifang Zhang, Liebin Zhao, Yuqi Zhang:
Intelligent detection of left ventricular hypertrophy from pediatric echocardiography videos. Int. J. Imaging Syst. Technol. 34(3) (2024) - [j20]Jingke Xu, Yaqian Zhang, Ke Wang, Zhifang Zhang:
Cooperative Repair of Reed-Solomon Codes via Linearized Permutation Polynomials. IEEE Trans. Inf. Theory 70(7): 4747-4758 (2024) - [c21]Yuhang Pi, Zhifang Zhang, Yaqian Zhang:
Improved Non-Asymptotic Lower Bound on the Size of Optimal Insertion/Deletion Correcting Code. ISIT 2024: 1095-1100 - [c20]Zhongyan Liu, Zhifang Zhang:
A Formula for the I/O Cost of Linear Repair Schemes and Application to Reed-Solomon Codes. ISIT 2024: 2128-2133 - [c19]Zhongyan Liu, Zhifang Zhang:
A Family of Access-Friendly MDS Array Codes. ISIT 2024: 2353-2358 - [i27]Zhongyan Liu, Zhifang Zhang:
A Formula for the I/O Cost of Linear Repair Schemes and Application to Reed-Solomon Codes. CoRR abs/2401.04912 (2024) - [i26]Yuhang Pi, Zhifang Zhang:
Two-Insertion/Deletion/Substitution Correcting Codes. CoRR abs/2401.11231 (2024) - [i25]Zhifang Zhang, Beibei Li:
Tuning Vision-Language Models with Candidate Labels by Prompt Alignment. CoRR abs/2407.07638 (2024) - [i24]Zhongyan Liu, Jingke Xu, Zhifang Zhang:
Calculating the I/O Cost of Linear Repair Schemes for RS Codes Evaluated on Subspaces via Exponential Sums. CoRR abs/2412.18430 (2024) - [i23]Zhifang Zhang, Shuo He, Bingquan Shen, Lei Feng:
Defending Multimodal Backdoored Models by Repulsive Visual Prompt Tuning. CoRR abs/2412.20392 (2024) - 2023
- [j19]Zhaogang Shu, Haoxian Feng, Tarik Taleb, Zhifang Zhang:
A novel combinatorial multi-armed bandit game to identify online the changing top-K flows in software-defined networks. Comput. Networks 230: 109783 (2023) - [j18]Ke Wang, Zhifang Zhang:
Bidirectional Piggybacking Design for All Nodes With Sub-Packetization 2 ≤ l ≤ r. IEEE Trans. Commun. 71(12): 6859-6869 (2023) - [j17]Zhifang Zhang, Liyang Zhou:
A Vertical-Horizontal Framework for Building Rack-Aware Regenerating Codes. IEEE Trans. Inf. Theory 69(5): 2874-2885 (2023) - [c18]Fan Yang, Tedder Meng, Zhifang Zhang, Yu Huang:
Industry Session I: On Automotive Testing. ATS 2023: 1 - [c17]Ke Wang, Zhifang Zhang:
Bidirectional Piggybacking Design for All Nodes with Sub-Packetization l = r. ITW 2023: 305-310 - [i22]Yiman Liu, Qiming Huang, Xiaoxiang Han, Tongtong Liang, Zhifang Zhang, Lijun Chen, Jinfeng Wang, Angelos Stefanidis, Jionglong Su, Jiangang Chen, Qingli Li, Yuqi Zhang:
Atrial Septal Defect Detection in Children Based on Ultrasound Video Using Multiple Instances Learning. CoRR abs/2306.03835 (2023) - 2022
- [j16]Liyang Zhou, Zhifang Zhang:
Explicit construction of minimum bandwidth rack-aware regenerating codes. Sci. China Inf. Sci. 65(7): 1-2 (2022) - [j15]Liyang Zhou, Zhifang Zhang:
Rack-Aware Regenerating Codes With Multiple Erasure Tolerance. IEEE Trans. Commun. 70(7): 4316-4326 (2022) - 2021
- [c16]Zhifang Zhang, Liyang Zhou:
Rack-Aware Regenerating Codes with Fewer Helper Racks. ISIT 2021: 2203-2207 - [i21]Zhifang Zhang, Liyang Zhou:
Rack-Aware Regenerating Codes with Fewer Helper Racks. CoRR abs/2101.08738 (2021) - [i20]Liyang Zhou, Zhifang Zhang:
Explicit Construction of Minimum Bandwidth Rack-Aware Regenerating Codes. CoRR abs/2103.01533 (2021) - [i19]Liyang Zhou, Zhifang Zhang:
Explicit Construction of Minimum Storage Rack-Aware Regenerating Codes for All Parameters. CoRR abs/2103.15471 (2021) - [i18]Liyang Zhou, Zhifang Zhang:
Rack-Aware Regenerating Codes with Multiple Erasure Tolerance. CoRR abs/2106.03302 (2021) - 2020
- [j14]Qingyi Zhan, Zhifang Zhang, Xiangdong Xie:
Numerical study on (ω, Lδ)-Lipschitz shadowing of stochastic differential equations. Appl. Math. Comput. 376: 125108 (2020) - [j13]Yaqian Zhang, Zhifang Zhang, Lu Wang:
Explicit Constructions of Optimal-Access MSCR Codes for All Parameters. IEEE Commun. Lett. 24(5): 941-945 (2020) - [j12]Yaqian Zhang, Zhifang Zhang:
Scalar MSCR Codes via the Product Matrix Construction. IEEE Trans. Inf. Theory 66(2): 995-1006 (2020) - [c15]Liyang Zhou, Zhifang Zhang:
Explicit Construction of Minimum Storage Rack-Aware Regenerating Codes for All Parameters. ITW 2020: 1-5
2010 – 2019
- 2019
- [j11]Zhifang Zhang, Qingyi Zhan, Xiangdong Xie:
Numerical Study on Stochastic Diabetes Mellitus Model with Additive Noise. Comput. Math. Methods Medicine 2019: 5409180:1-5409180:8 (2019) - [j10]Zhifang Zhang, Jingke Xu:
The Optimal Sub-Packetization of Linear Capacity-Achieving PIR Schemes With Colluding Servers. IEEE Trans. Inf. Theory 65(5): 2723-2735 (2019) - [j9]Anyu Wang, Zhifang Zhang, Dongdai Lin:
Bounds for Binary Linear Locally Repairable Codes via a Sphere-Packing Approach. IEEE Trans. Inf. Theory 65(7): 4167-4179 (2019) - [c14]Yaqian Zhang, Zhifang Zhang:
An Improved Cooperative Repair Scheme for Reed-Solomon Codes. ISCIT 2019: 525-530 - [c13]Jingke Xu, Yaqian Zhang, Zhifang Zhang:
A Capacity-Achieving T-PIR Scheme Based On MDS Array Codes. ISIT 2019: 1047-1051 - [i17]Yaqian Zhang, Zhifang Zhang:
An Improved Cooperative Repair Scheme for Reed-Solomon Codes. CoRR abs/1901.03142 (2019) - [i16]Jingke Xu, Yaqian Zhang, Zhifang Zhang:
A Capacity-Achieving T-PIR Scheme Based On MDS Array Codes. CoRR abs/1901.05772 (2019) - 2018
- [j8]Jingke Xu, Zhifang Zhang:
On sub-packetization and access number of capacity-achieving PIR schemes for MDS coded non-colluding servers. Sci. China Inf. Sci. 61(10): 100306:1-100306:16 (2018) - [c12]Jingke Xu, Zhifang Zhang:
Building Capacity-Achieving PIR Schemes with Optimal Sub-Packetization over Small Fields. ISIT 2018: 1749-1753 - [i15]Jingke Xu, Zhifang Zhang:
Building Capacity-Achieving PIR Schemes with Optimal Sub-Packetization over Small Fields. CoRR abs/1801.02324 (2018) - [i14]Yaqian Zhang, Zhifang Zhang:
Scalar MSCR Codes via the Product Matrix Construction. CoRR abs/1810.04611 (2018) - 2017
- [c11]Anyu Wang, Zhifang Zhang, Dongdai Lin:
Bounds and constructions for linear locally repairable codes over binary fields. ISIT 2017: 2033-2037 - [i13]Anyu Wang, Zhifang Zhang, Dongdai Lin:
Bounds and Constructions for Linear Locally Repairable Codes over Binary Fields. CoRR abs/1701.05989 (2017) - [i12]Zhifang Zhang, Jingke Xu:
Capacity-Achieving PIR Schemes with Optimal Sub-Packetization. CoRR abs/1710.11370 (2017) - [i11]Jingke Xu, Zhifang Zhang:
On Sub-Packetization of Capacity-Achieving PIR Schemes for MDS Coded Databases. CoRR abs/1712.02466 (2017) - 2016
- [c10]Xiaoge Huang, Weipeng Dai, Zhifang Zhang, Qiong Huang, Qianbin Chen:
Energy-Efficient Resource Allocation in Distributed Antenna Systems. ChinaCom (1) 2016: 97-106 - [c9]Xiaoge Huang, Zhifang Zhang, Weipeng Dai, Qiong Huang, Qianbin Chen:
Energy-Efficient Femtocells Active/Idle Control and Load Balancing in Heterogeneous Networks. ChinaCom (2) 2016: 237-247 - [c8]Anyu Wang, Zhifang Zhang, Dongdai Lin:
Two classes of (r, t)-locally repairable codes. ISIT 2016: 445-449 - 2015
- [j7]Anyu Wang, Zhifang Zhang:
An Integer Programming-Based Bound for Locally Repairable Codes. IEEE Trans. Inf. Theory 61(10): 5280-5294 (2015) - [c7]Anyu Wang, Zhifang Zhang, Mulan Liu:
Achieving arbitrary locality and availability in binary codes. ISIT 2015: 1866-1870 - [i10]Anyu Wang, Zhifang Zhang:
Achieving Arbitrary Locality and Availability in Binary Codes. CoRR abs/1501.04264 (2015) - 2014
- [j6]Anyu Wang, Zhifang Zhang:
Repair Locality With Multiple Erasure Tolerance. IEEE Trans. Inf. Theory 60(11): 6979-6987 (2014) - [c6]Anyu Wang, Zhifang Zhang:
Repair locality from a combinatorial perspective. ISIT 2014: 1972-1976 - [i9]Anyu Wang, Zhifang Zhang:
Repair Locality From a Combinatorial Perspective. CoRR abs/1401.2607 (2014) - [i8]Anyu Wang, Zhifang Zhang:
An Integer Programming Based Bound for Locally Repairable Codes. CoRR abs/1409.0952 (2014) - 2013
- [j5]Zhifang Zhang, Mulan Liu:
Rational secret sharing as extensive games. Sci. China Inf. Sci. 56(3): 1-13 (2013) - [c5]Anyu Wang, Zhifang Zhang:
Exact cooperative regenerating codes with minimum-repair-bandwidth for distributed storage. INFOCOM 2013: 400-404 - [i7]Anyu Wang, Zhifang Zhang:
Repair Locality with Multiple Erasure Tolerance. CoRR abs/1306.4774 (2013) - 2012
- [j4]Zhifang Zhang, Yeow Meng Chee, San Ling, Mulan Liu, Huaxiong Wang:
Threshold changeable secret sharing schemes revisited. Theor. Comput. Sci. 418: 106-115 (2012) - [i6]Anyu Wang, Zhifang Zhang:
Exact Cooperative Regenerating Codes with Minimum-Repair-Bandwidth for Distributed Storage. CoRR abs/1207.0879 (2012) - [i5]Zhifang Zhang:
Network Coding Based on Chinese Remainder Theorem. CoRR abs/1208.3966 (2012) - 2010
- [c4]Zhifang Zhang, Mulan Liu:
Unconditionally Secure Rational Secret Sharing in Standard Communication Networks. ICISC 2010: 355-369 - [c3]Rentao Zhao, Zhifang Zhang, Jun Tie, Jun Li:
Design and implementation of mesh-based current distribution on-line monitoring system in aluminum reduction cells. WCNIS 2010: 143-146 - [i4]Zhifang Zhang:
Unconditionally Secure Rational Secret Sharing in Standard Communication Networks. IACR Cryptol. ePrint Arch. 2010: 462 (2010)
2000 – 2009
- 2008
- [j3]Zhifang Zhang, Mulan Liu, Liangliang Xiao:
Rearrangements of access structures and their realizations in secret sharing schemes. Discret. Math. 308(21): 4882-4891 (2008) - [c2]Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling, Huaxiong Wang:
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes. ASIACRYPT 2008: 19-36 - [i3]Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling, Huaxiong Wang:
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes. CoRR abs/0812.2518 (2008) - 2007
- [j2]Mulan Liu, Liangliang Xiao, Zhifang Zhang:
Multiplicative Linear Secret Sharing Schemes Based on Connectivity of Graphs. IEEE Trans. Inf. Theory 53(11): 3973-3978 (2007) - 2006
- [j1]Mulan Liu, Liangliang Xiao, Zhifang Zhang:
Linear multi-secret sharing schemes based on multi-party computation. Finite Fields Their Appl. 12(4): 704-713 (2006) - 2005
- [c1]Zhifang Zhang, Mulan Liu, Liangliang Xiao:
Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes. ASIACRYPT 2005: 156-173 - [i2]Liangliang Xiao, Mulan Liu, Zhifang Zhang:
Multiparty Computation Based on Connectivity of Graphs. IACR Cryptol. ePrint Arch. 2005: 143 (2005) - [i1]Liangliang Xiao, Mulan Liu, Zhifang Zhang:
Statistical Multiparty Computation Based on Random Walks on Graphs. IACR Cryptol. ePrint Arch. 2005: 337 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-08 20:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
