Results 141 to 150 of about 459 (161)

Complete Characterization of Optimal LRCs with Minimum Distance 6 and Locality 2: Improved Bounds and Constructions

2020 IEEE International Symposium on Information Theory (ISIT), 2020
Locally repairable codes (LRCS) with locality r were introduced to recover an erased code symbol by accessing at most r other code symbols. An LRC achieving the well-known Singleton-type bound is called an optimal LRC. Constructing optimal LRCs has been a hot topic of coding theory in recent years. Similar to the famous MDS conjecture, the maximum code
Weijun Fang, Shu-Tao Xia, Fang-Wei Fu
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Perfect LRCs and k-optimal LRCs

Designs, Codes, and Cryptography, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weijun Fang, Shu-Tao Xia, Fang-Wei Fu
exaly   +3 more sources

Two classes of optimal LRCs with information (r, t)-locality

Designs, Codes, and Cryptography, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pan Tan, Zhengchun Zhou, Vladimir Sidorenko   +2 more
exaly   +3 more sources

Optimal and Almost Optimal Cyclic (r,δ)-LRCs With Large Code Lengths

2022 IEEE International Symposium on Information Theory (ISIT), 2022
Weijun Fang, Fang-Wei Fu
exaly   +2 more sources

Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes

Finite Fields and Their Applications, 2023
Locally repairable codes (LRCs) have emerged as an important coding scheme in distributed storage systems (DSSs) with relatively low repair cost by accessing fewer non-failure nodes.
Weijun Fang, Fang-Wei Fu, Shu-Tao Xia
exaly   +2 more sources

Optimal Constructions of LRCs based on Cayley Table

2023 14th International Conference on Computing Communication and Networking Technologies (ICCCNT), 2023
Sanjit Bhowmick, Satya Bagchi
exaly   +2 more sources

Some Constructions of Perfect and k-optimal (r,δ)-LRCs

2023 IEEE International Symposium on Information Theory (ISIT), 2023
Fang-Wei Fu
exaly   +2 more sources

Good polynomials for optimal LRC of low locality

Designs, Codes and Cryptography, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ruikai Chen, Sihem Mesnager, Chang-An Zhao   +2 more
openaire   +2 more sources

Hull dimension of optimal binary LRCs with availability

Cryptography and Communications
Satya Bagchi
exaly   +2 more sources

Optimal RS-like LRC codes of arbitrary length

Applicable Algebra in Engineering, Communication and Computing, 2020
RS-like locally recoverable (LRC) codes have a construction based on the classical construction of Reed-Solomon (RS) codes, where codewords are obtained as evaluations of suitably chosen polynomials. These codes were previously introduced under the assumption that the length \(n\) of the code is divisible by \(r+1,\) where \(r\) is the locality of the ...
Charul Rajput, Maheshanand Bhaintwal
openaire   +2 more sources