NDLI: Linear locally repairable codes with availability

Content Provider	IEEE Xplore Digital Library
Author	Pengfei Huang Yaakobi, E. Uchikawa, H. Siegel, P.H.
Copyright Year	2015
Description	Author affiliation: Electr. & Comput. Eng. Dept., Univ. of California, San Diego, La Jolla, CA, USA (Pengfei Huang; Uchikawa, H.; Siegel, P.H.) \|\| Comput. Sci. Dept., Technion - Israel Inst. of Technol., Haifa, Israel (Yaakobi, E.)
Abstract	In this work, we present a new upper bound on the minimum distance d of linear locally repairable codes (LRCs) with information locality and availability. The bound takes into account the code length n, dimension k, locality r, availability t, and field size q. We use tensor product codes to construct several families of LRCs with information locality, and then we extend the construction to design LRCs with information locality and availability. Some of these codes are shown to be optimal with respect to their minimum distance, achieving the new bound. Finally, we study the all-symbol locality and availability properties of several classes of one-step majority-logic decodable codes, including cyclic simplex codes, cyclic difference-set codes, and 4-cycle free regular low-density parity-check (LDPC) codes. We also investigate their optimality using the new bound.
Starting Page	1871
Ending Page	1875
File Size	193612
Page Count	5
File Format	PDF
ISSN	21578117
e-ISBN	9781467377041
DOI	10.1109/ISIT.2015.7282780
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-06-14
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Systematics Upper bound Maintenance engineering Tensile stress Linear codes Product codes Binary codes
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Cyclic linear binary locally repairable codes

Optimal linear and cyclic locally repairable codes over small fields

Binary cyclic codes that are locally repairable

On codes with availability for distributed storage

Linear programming bounds for robust locally repairable storage codes

Binary locally repairable codes from complete multipartite graphs

Achieving arbitrary locality and availability in binary codes

An Integer Programming-Based Bound for Locally Repairable Codes

Optimal binary locally repairable codes with joint information locality

Linear locally repairable codes with availability

Similar Documents

Cyclic linear binary locally repairable codes

Optimal linear and cyclic locally repairable codes over small fields

Binary cyclic codes that are locally repairable

On codes with availability for distributed storage

Linear programming bounds for robust locally repairable storage codes

Binary locally repairable codes from complete multipartite graphs

Achieving arbitrary locality and availability in binary codes

An Integer Programming-Based Bound for Locally Repairable Codes

Optimal binary locally repairable codes with joint information locality

Linear locally repairable codes with availability