The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Kod boleh dibaiki setempat (LRC) dengan ketersediaan telah mendapat perhatian yang besar sejak beberapa tahun kebelakangan ini kerana ia dapat menyelesaikan banyak masalah dalam sistem storan teragih seperti membaiki pelbagai kegagalan nod dan mengurus data panas. Membina LRC dengan lokaliti r dan ketersediaan t (juga dipanggil (r, t)-LRCs) dengan parameter baharu menjadi subjek penyelidikan yang menarik dalam teori pengekodan. Objektif kertas ini adalah untuk mencadangkan dua pembinaan generik kitaran (r, t)-LRC melalui polinomial linear ke atas medan terhingga. Kedua-dua pembinaan ini termasuk dua LRC kitaran yang lebih awal daripada fungsi surih dan fungsi surih terpotong sebagai kes khas dan membawa kepada LRC dengan parameter baharu yang tidak boleh dihasilkan oleh yang terdahulu.
Pan TAN
Southwest Jiaotong University
Zhengchun ZHOU
Southwest Jiaotong University
Haode YAN
Southwest Jiaotong University
Yong WANG
Southwest Jiaotong University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Pan TAN, Zhengchun ZHOU , Haode YAN, Yong WANG, "Cyclic LRCs with Availability from Linearized Polynomials" in IEICE TRANSACTIONS on Fundamentals,
vol. E104-A, no. 7, pp. 991-995, July 2021, doi: 10.1587/transfun.2020EAL2100.
Abstract: Locally repairable codes (LRCs) with availability have received considerable attention in recent years since they are able to solve many problems in distributed storage systems such as repairing multiple node failures and managing hot data. Constructing LRCs with locality r and availability t (also called (r, t)-LRCs) with new parameters becomes an interesting research subject in coding theory. The objective of this paper is to propose two generic constructions of cyclic (r, t)-LRCs via linearized polynomials over finite fields. These two constructions include two earlier ones of cyclic LRCs from trace functions and truncated trace functions as special cases and lead to LRCs with new parameters that can not be produced by earlier ones.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020EAL2100/_p
Salinan
@ARTICLE{e104-a_7_991,
author={Pan TAN, Zhengchun ZHOU , Haode YAN, Yong WANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Cyclic LRCs with Availability from Linearized Polynomials},
year={2021},
volume={E104-A},
number={7},
pages={991-995},
abstract={Locally repairable codes (LRCs) with availability have received considerable attention in recent years since they are able to solve many problems in distributed storage systems such as repairing multiple node failures and managing hot data. Constructing LRCs with locality r and availability t (also called (r, t)-LRCs) with new parameters becomes an interesting research subject in coding theory. The objective of this paper is to propose two generic constructions of cyclic (r, t)-LRCs via linearized polynomials over finite fields. These two constructions include two earlier ones of cyclic LRCs from trace functions and truncated trace functions as special cases and lead to LRCs with new parameters that can not be produced by earlier ones.},
keywords={},
doi={10.1587/transfun.2020EAL2100},
ISSN={1745-1337},
month={July},}
Salinan
TY - JOUR
TI - Cyclic LRCs with Availability from Linearized Polynomials
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 991
EP - 995
AU - Pan TAN
AU - Zhengchun ZHOU
AU - Haode YAN
AU - Yong WANG
PY - 2021
DO - 10.1587/transfun.2020EAL2100
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E104-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2021
AB - Locally repairable codes (LRCs) with availability have received considerable attention in recent years since they are able to solve many problems in distributed storage systems such as repairing multiple node failures and managing hot data. Constructing LRCs with locality r and availability t (also called (r, t)-LRCs) with new parameters becomes an interesting research subject in coding theory. The objective of this paper is to propose two generic constructions of cyclic (r, t)-LRCs via linearized polynomials over finite fields. These two constructions include two earlier ones of cyclic LRCs from trace functions and truncated trace functions as special cases and lead to LRCs with new parameters that can not be produced by earlier ones.
ER -