9 citations · 16 across the 5 of their papers we have counts for
8 papers · 1 filter
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…
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…
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…