Related Experiment Video
Updated: May 10, 2026

Automated Robotic Liquid Handling Assembly of Modular DNA Devices
Published on: December 1, 2017
Construction of Binary Locally Repairable Codes with Nonuniform Locality and Availability Using Combinatorial Designs
1School of Information Management, Shanghai Lixin University of Accounting and Finance, Shanghai 201209, China.
Abstract:
In this paper, we generalize the construction of locally repairable codes (LRCs) by leveraging pairwise balanced designs (PBDs) and balanced incomplete block designs (BIBDs) to construct codes with nonuniform locality or nonuniform availability. Our constructions prioritize binary implementations for practical deployment while achieving optimal or near-optimal performance in terms of rate, minimum distance, and repair efficiency. Specifically, we propose distance-optimal LRCs with nonuniform localities and message-symbol (r,t)-availability. These binary constructions achieve optimal minimum distance under known bounds and have higher code rates than existing works. We also address open problems in the literature, including constructions where r∤k, and demonstrate that our constructions encompass or outperform several prior works.
Related Concept Videos
Law of Independent Assortment
Long-patch Base Excision Repair
Fixing Double-strand Breaks
Conservative Site-specific Recombination and Phase Variation
The recognition sites for Cre recombinase called LoxP...
Combinatorial Gene Control
The expression of more than 30,000 genes is controlled by approximately 2000-3000 transcription factors. This is possible because a single transcription factor can recognize more than one regulatory sequence. The specificity in gene...
Fixing Double-strand Breaks

