9 citations · 29 across the 12 of their papers we have counts for
15 papers
Trellis codes with a good distance profile constructed from expander graphs
Yubin Zhu, Zitan Chen
We derive Singleton-type bounds on the free distance and column distances of trellis codes. Our results show that, at a given time instant, the maximum attainable column distance o…
First-order optimal codes for an adversarial nanopore channel
Huiling Xie, Zitan Chen
We study error-correcting codes for an adversarial nanopore channel, where a -ary string is first transformed by an inter-symbol interference channel with window size int…
Coding methods for string reconstruction from erroneous prefix-suffix compositions
Zitan Chen
The number of zeros and the number of ones in a binary string are referred to as the composition of the string, and the prefix-suffix compositions of a string are a multiset formed…
Reconstruction of multiple strings of constant weight from prefix-suffix compositions
Yaoyu Yang, Zitan Chen
Motivated by studies of data retrieval in polymer-based storage systems, we consider the problem of reconstructing a multiset of binary strings that have the same length and the sa…
Cross-Silo Prototypical Calibration for Federated Learning with Non-IID Data
Zhuang Qi, Lei Meng, Zitan Chen +3
Federated Learning aims to learn a global model on the server side that generalizes to all clients in a privacy-preserving manner, by leveraging the local models from different cli…
A lower bound on the field size of convolutional codes with a maximum distance profile and an improved construction
Zitan Chen
Convolutional codes with a maximum distance profile attain the largest possible column distances for the maximum number of time instants and thus have outstanding error-correcting…
Rack-aware minimum-storage regenerating codes with optimal access
Jiaojiao Wang, Zitan Chen
We derive a lower bound on the amount of information accessed to repair failed nodes within a single rack from any number of helper racks in the rack-aware storage model that allow…
Multi-modal Video Chapter Generation
Xiao Cao, Zitan Chen, Canyu Le +1
Chapter generation becomes practical technique for online videos nowadays. The chapter breakpoints enable users to quickly find the parts they want and get the summative annotation…
Convolutional codes with a maximum distance profile based on skew polynomials
Zitan Chen
We construct a family of (n,k) convolutional codes with degree δin {k,n-k} that have a maximum distance profile. The field size required for our construction is of the order n^{2δ}…
A construction of maximally recoverable codes
Alexander Barg, Zitan Chen, Itzhak Tamo
We construct a family of linear maximally recoverable codes with locality and dimension For codes of length with the code alphabet is of t…
Cyclic and convolutional codes with locality
Zitan Chen, Alexander Barg
Locally recoverable (LRC) codes and their variants have been extensively studied in recent years. In this paper we focus on cyclic constructions of LRC codes and derive conditions…
Enabling optimal access and error correction for the repair of Reed-Solomon codes
Zitan Chen, Min Ye, Alexander Barg
Recently Reed-Solomon (RS) codes were shown to possess a repair scheme that supports repair of failed nodes with optimal repair bandwidth. In this paper, we extend this result in t…
Explicit constructions of MSR codes for clustered distributed storage: The rack-aware storage model
Zitan Chen, Alexander Barg
The paper is devoted to the problem of erasure coding in distributed storage. We consider a model of storage that assumes that nodes are organized into equally sized groups, called…
The Capacity of Online (Causal) -ary Error-Erasure Channels
Zitan Chen, Sidharth Jaggi, Michael Langberg
In the -ary online (or "causal") channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword $\mathbf{x} =(x_1,\ldots,x_n) \in \{0,1,…
A characterization of the capacity of online (causal) binary channels
Zitan Chen, Sidharth Jaggi, Michael Langberg
In the binary online (or "causal") channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword $\mathbf{x} =(x_1,\ldots,x_n) \in \{0,1\}…