Title
New Constructions of Binary LRCs With Disjoint Repair Groups and Locality 3 Using Existing LRCs
Abstract
New constructions of linear binary locally repairable codes (LRCs) with disjoint repair groups, locality 3, and minimum Hamming distance larger than or equal to six are proposed by using existing binary LRCs. The proposed linear binary LRCs are optimal or near-optimal in terms of the bound of binary LRCs with disjoint repair groups.
Year
DOI
Venue
2019
10.1109/LCOMM.2019.2892950
IEEE Communications Letters
Keywords
Field
DocType
Maintenance engineering,Hamming weight,Hamming distance,Parity check codes,Two dimensional displays,Systematics,Generators
Discrete mathematics,Locality,Disjoint sets,Computer science,Computer network,Hamming distance,Hamming weight,Binary number
Journal
Volume
Issue
ISSN
23
3
1089-7798
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Chanki Kim142.48
Jong-Seon No2969118.07