default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZitan Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2020
[b1]Zitan Chen:
Codes with efficient erasure correction. University of Maryland, College Park, MD, USA, 2020
Journal Articles
- 2024
- [j8]Zitan Chen
:
A Lower Bound on the Field Size of Convolutional Codes With a Maximum Distance Profile and an Improved Construction. IEEE Trans. Inf. Theory 70(6): 4064-4073 (2024) - 2022
- [j7]Alexander Barg, Zitan Chen, Itzhak Tamo:
A construction of maximally recoverable codes. Des. Codes Cryptogr. 90(4): 939-945 (2022) - [j6]Zitan Chen:
Convolutional Codes With a Maximum Distance Profile Based on Skew Polynomials. IEEE Trans. Inf. Theory 68(8): 5178-5184 (2022) - 2021
- [j5]Xiao Cao, Wenjia He, Zitan Chen, Yifan Li, Kexin Wang, Hongbo Zhang, Lesong Wei, Lizhen Cui, Ran Su, Leyi Wei:
PSSP-MVIRT: peptide secondary structure prediction based on a multi-view deep learning architecture. Briefings Bioinform. 22(6) (2021) - [j4]Zitan Chen, Alexander Barg:
Cyclic and Convolutional Codes With Locality. IEEE Trans. Inf. Theory 67(2): 755-769 (2021) - 2020
- [j3]Zitan Chen, Alexander Barg:
Explicit Constructions of MSR Codes for Clustered Distributed Storage: The Rack-Aware Storage Model. IEEE Trans. Inf. Theory 66(2): 886-899 (2020) - [j2]Zitan Chen, Min Ye, Alexander Barg:
Enabling Optimal Access and Error Correction for the Repair of Reed-Solomon Codes. IEEE Trans. Inf. Theory 66(12): 7439-7456 (2020) - 2019
- [j1]Zitan Chen, Sidharth Jaggi, Michael Langberg:
The Capacity of Online (Causal) $q$ -Ary Error-Erasure Channels. IEEE Trans. Inf. Theory 65(6): 3384-3411 (2019)
Conference and Workshop Papers
- 2024
- [c14]Yaoyu Yang, Zitan Chen:
Reconstruction of multiple strings of constant weight from prefix-suffix compositions. ISIT 2024: 897-902 - 2023
- [c13]Tianhan Liu, Zhuang Qi, Zitan Chen, Xiangxu Meng, Lei Meng:
Cross-Training with Prototypical Distillation for improving the generalization of Federated Learning. ICME 2023: 648-653 - [c12]Jiaojiao Wang, Zitan Chen:
Low-access repair of Reed-Solomon codes in rack-aware storage. ISIT 2023: 1142-1147 - [c11]Zitan Chen, Zhuang Qi, Xiao Cao, Xiangxian Li, Xiangxu Meng, Lei Meng:
Class-level Structural Relation Modeling and Smoothing for Visual Representation Learning. ACM Multimedia 2023: 2964-2972 - [c10]Zhuang Qi, Lei Meng, Zitan Chen, Han Hu, Hui Lin, Xiangxu Meng:
Cross-Silo Prototypical Calibration for Federated Learning with Non-IID Data. ACM Multimedia 2023: 3099-3107 - [c9]Zitan Chen, Zhuang Qi, Xiangxian Li, Yuqing Wang, Lei Meng, Xiangxu Meng:
Class-aware Convolution and Attentive Aggregation for Image Classification. MMAsia 2023: 20:1-20:7 - 2022
- [c8]Zhuang Qi, Yuqing Wang, Zitan Chen, Ran Wang, Xiangxu Meng, Lei Meng:
Clustering-based Curriculum Construction for Sample-Balanced Federated Learning. CICAI (3) 2022: 155-166 - [c7]Zitan Chen:
Rack-aware MSR codes with optimal access. ITW 2022: 19-24 - 2020
- [c6]Zitan Chen, Min Ye, Alexander Barg:
Repair of RS codes with optimal access and error correction. ISIT 2020: 589-594 - [c5]Zitan Chen, Alexander Barg:
Cyclic LRC codes with hierarchy and availability. ISIT 2020: 616-621 - 2019
- [c4]Zitan Chen, Alexander Barg:
Explicit constructions of MSR codes for the rack-aware storage model. ISIT 2019: 226-230 - 2018
- [c3]Zitan Chen, Alexander Barg:
The repair problem under connectivity constraints: Explicit MSR codes for the rack-aware model of distributed storage. Allerton 2018: 710-714 - 2016
- [c2]Zitan Chen, Sidharth Jaggi, Michael Langberg:
The capacity of online (causal) q-ary error-erasure channels. ISIT 2016: 915-919 - 2015
- [c1]Zitan Chen, Sidharth Jaggi, Michael Langberg:
A Characterization of the Capacity of Online (causal) Binary Channels. STOC 2015: 287-296
Informal and Other Publications
- 2024
- [i13]Yihang Wu, Xiao Cao, Kaixin Li, Zitan Chen, Haonan Wang, Lei Meng, Zhiyong Huang:
Towards Better Text-to-Image Generation Alignment via Attention Modulation. CoRR abs/2404.13899 (2024) - 2023
- [i12]Jiaojiao Wang, Zitan Chen:
Rack-aware minimum-storage regenerating codes with optimal access. CoRR abs/2304.08747 (2023) - [i11]Zitan Chen:
A lower bound on the field size of convolutional codes with a maximum distance profile and an improved construction. CoRR abs/2305.08388 (2023) - [i10]Zhuang Qi, Lei Meng, Zitan Chen, Han Hu, Hui Lin, Xiangxu Meng:
Cross-Silo Prototypical Calibration for Federated Learning with Non-IID Data. CoRR abs/2308.03457 (2023) - [i9]Zitan Chen, Zhuang Qi, Xiao Cao, Xiangxian Li, Xiangxu Meng, Lei Meng:
Class-level Structural Relation Modelling and Smoothing for Visual Representation Learning. CoRR abs/2308.04142 (2023) - 2022
- [i8]Xiao Cao, Zitan Chen, Canyu Le, Lei Meng:
Multi-modal Video Chapter Generation. CoRR abs/2209.12694 (2022) - 2021
- [i7]Alexander Barg, Zitan Chen, Itzhak Tamo:
A construction of maximally recoverable codes. CoRR abs/2108.08679 (2021) - [i6]Zitan Chen:
Convolutional codes with a maximum distance profile based on skew polynomials. CoRR abs/2112.04118 (2021) - 2020
- [i5]Zitan Chen, Min Ye, Alexander Barg:
Enabling optimal access and error correction for the repair of Reed-Solomon codes. CoRR abs/2001.07189 (2020) - [i4]Zitan Chen, Alexander Barg:
Cyclic and convolutional codes with locality. CoRR abs/2004.06770 (2020) - 2019
- [i3]Zitan Chen, Alexander Barg:
Explicit constructions of MSR codes for clustered distributed storage: The rack-aware storage model. CoRR abs/1901.04419 (2019) - 2016
- [i2]Zitan Chen, Sidharth Jaggi, Michael Langberg:
The Capacity of Online (Causal) $q$-ary Error-Erasure Channels. CoRR abs/1602.00276 (2016) - 2014
- [i1]Zitan Chen, Sidharth Jaggi, Michael Langberg:
A characterization of the capacity of online (causal) binary channels. CoRR abs/1412.6376 (2014)
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 2024-10-13 18:00 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:
