research
∙
12/10/2021
Optimal Quaternary (r,delta)-Locally Repairable Codes Achieving the Singleton-type Bound
Locally repairable codes enables fast repair of node failure in a distri...
share
research
∙
09/24/2020
Multichannel Conflict-Avoiding Codes of Weights Three and Four
Conflict-avoiding codes (CACs) were introduced by Levenshtein as a singl...
research
∙
09/19/2020
Schedule Sequence Design for Broadcast in Multi-channel Ad Hoc Networks
We consider a single-hop ad hoc network in which each node aims to broad...
research
∙
05/15/2020
Network Coding Based on Byte-wise Circular Shift and Integer Addition
A novel implementation of a special class of Galois ring, in which the m...
research
∙
05/14/2020
On the Optimal Minimum Distance of Fractional Repetition Codes
Fractional repetition (FR) codes are a class of repair efficient erasure...
research
∙
01/10/2019
Capacity of Distributed Storage Systems with Clusters and Separate Nodes
In distributed storage systems (DSSs), the optimal tradeoff between node...
research
∙
08/06/2018
On the Duality and File Size Hierarchy of Fractional Repetition Codes
Distributed storage systems that deploy erasure codes can provide better...
research
∙
05/08/2018
On Secure Exact-repair Regenerating Codes with a Single Pareto Optimal Point
The problem of exact-repair regenerating codes against eavesdropping att...
research
∙
03/09/2018
A Unified Form of EVENODD and RDP Codes and Their Efficient Decoding
Array codes have been widely employed in storage systems, such as Redund...
research
∙
02/12/2018