Gotowe bibliografie tematyczne / Locally Recoverable Codes

Spis treści

  1. Artykuły w czasopismach
  2. Rozprawy doktorskie
  3. Części książek
  4. Streszczenia konferencji

Gotowa bibliografia na temat „Locally Recoverable Codes”

Autor: Grafiati
Data publikacji: 6 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Locally Recoverable Codes”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Locally Recoverable Codes"

1

Salgado, Cecilia, Anthony Varilly-Alvarado i Jose Felipe Voloch. "Locally Recoverable Codes on Surfaces". IEEE Transactions on Information Theory 67, nr 9 (wrzesień 2021): 5765–77. http://dx.doi.org/10.1109/tit.2021.3090939.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Kim, Boran. "Locally recoverable codes in Hermitian function fields with certain types of divisors". AIMS Mathematics 7, nr 6 (2022): 9656–67. http://dx.doi.org/10.3934/math.2022537.

Pełny tekst źródła
Streszczenie:
<abstract><p>A locally recoverable code with locality $ \bf r $ can recover the missing coordinate from at most $ {\bf r} $ symbols. The locally recoverable codes have attracted a lot of attention because they are more advanced coding techniques that are applied to distributed and cloud storage systems. In this work, we focus on locally recoverable codes in Hermitian function fields over $ \Bbb F_{q^2} $, where $ q $ is a prime power. With a certain type of divisor, we obtain an improved lower bound of the minimum distance for locally recoverable codes in Hermitian function fields. For doing this, we give explicit formulae of the dimension for some divisors of Hermitian function fields. We also present a standard that tells us when a divisor with certain places suggests an improved lower bound.</p></abstract>
Style APA, Harvard, Vancouver, ISO itp.
3

Barg, Alexander, Itzhak Tamo i Serge Vladut. "Locally Recoverable Codes on Algebraic Curves". IEEE Transactions on Information Theory 63, nr 8 (sierpień 2017): 4928–39. http://dx.doi.org/10.1109/tit.2017.2700859.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Munuera, Carlos, i Wanderson Tenório. "Locally recoverable codes from rational maps". Finite Fields and Their Applications 54 (listopad 2018): 80–100. http://dx.doi.org/10.1016/j.ffa.2018.07.005.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Galindo, Carlos, Fernando Hernando i Carlos Munuera. "Locally recoverable J-affine variety codes". Finite Fields and Their Applications 64 (czerwiec 2020): 101661. http://dx.doi.org/10.1016/j.ffa.2020.101661.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Tamo, Itzhak, i Alexander Barg. "A Family of Optimal Locally Recoverable Codes". IEEE Transactions on Information Theory 60, nr 8 (sierpień 2014): 4661–76. http://dx.doi.org/10.1109/tit.2014.2321280.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Ballico, E. "Locally Recoverable Codes correcting many erasures over small fields". Designs, Codes and Cryptography 89, nr 9 (6.07.2021): 2157–62. http://dx.doi.org/10.1007/s10623-021-00905-4.

Pełny tekst źródła
Streszczenie:
AbstractWe define linear codes which are s-Locally Recoverable Codes (or s-LRC), i.e. codes which are LRC in s ways, the case $$s=1$$ s = 1 roughly corresponding to the classical case of LRC codes. We use them to describe codes which correct many erasures, although they have small minimum distance. Any letter of a received word may be corrected using s different local codes. We use the Segre embedding of s local codes and then a linear projection.
Style APA, Harvard, Vancouver, ISO itp.
8

Blaum, Mario, i Steven R. Hetzler. "Integrated interleaved codes as locally recoverable codes: properties and performance". International Journal of Information and Coding Theory 3, nr 4 (2016): 324. http://dx.doi.org/10.1504/ijicot.2016.079494.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Cadambe, Viveck R., i Arya Mazumdar. "Bounds on the Size of Locally Recoverable Codes". IEEE Transactions on Information Theory 61, nr 11 (listopad 2015): 5787–94. http://dx.doi.org/10.1109/tit.2015.2477406.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Tamo, Itzhak, Alexander Barg i Alexey Frolov. "Bounds on the Parameters of Locally Recoverable Codes". IEEE Transactions on Information Theory 62, nr 6 (czerwiec 2016): 3070–83. http://dx.doi.org/10.1109/tit.2016.2518663.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Locally Recoverable Codes"

1

Balaji, S. B. "Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions". Thesis, 2018. https://etd.iisc.ac.in/handle/2005/5330.

Pełny tekst źródła
Streszczenie:
The reliable storage of Big Data across a spatially distributed network of nodes, calls for erasure-correcting codes that in addition to protecting against data loss, can also efficiently handle node repair. The need for node repair could arise on account of device failure, need for a maintenance reboot, or simply because the node is busy serving other demands. An important consideration here is the rate of the code, which is the ratio of the number of data symbols to the total amount of storage needed to reliably store these data symbols. In response, coding theorists have come up with two new classes of codes, known respectively as regenerating codes and Locally Recoverable Codes (LRC). While the focus of the thesis is on LRC, there are also contributions to the theory of regenerating codes. Contributions to LRC: A LRC is quite simply, a code where a given code symbol can be recovered by contacting at most r other code symbols, where the parameter r is much smaller than the dimension k of the code. A LRC with sequential recovery, is a code that can recover from an arbitrary set of trerasures in t steps in a sequential fashion. Each step recovers an erased symbol and makes use of at most r other code symbols comprising of unerased symbols as well as previously recovered symbols. In this thesis, a tight upper bound on the rate of LRC with sequential recovery is provided, for any value of the number t of erasures and any value of the locality parameter r ≥ 3. This bound proves an earlier conjecture due to Song, Cai and Yuen. While the bound is valid irrespective of the field over which the code is defined, a matching construction of binary codes that achieve the upper bound on rate is also presented. Contributions to Regenerating Codes: Regenerating codes aim to minimize the amount of data download needed to repair a failed node. Regenerating codes are linear codes that operate over a vector alphabet, i.e., each code symbol in a regenerating code is a vector of α symbols drawn from a field F. An important open question relates to the minimum possible value of α for a given storage overhead. Here we present tight lower bounds on α for the case when the codes belong to a certain class of codes called MSR codes as well as have the property of optimal access, i.e., symbols are accessed and transmitted as such without any computation by helper node for repair of a failed node. Contribution to availability Codes: A code in which each code symbol can be recovered in t different ways using respectively t pairwise disjoint set of code symbols with each set of size at most r is called a code with t-availability. The contributions of the thesis in the direction of t-availability codes include improved upper bounds on the minimum distance dmin of this class of codes, both with and without a constraint on the size q of the code-symbol alphabet. An improved upper bound on code rate R is also provided for a subclass of t-availability codes, termed as codes with strict availability. Among the class of t-availability codes, codes with strict availability typically have high rate. A complete characterization of optimal tradeoff between rate and fractional minimum distance for a special class of t-availability codes is also provided. There are additional results which are not mentioned above including results relating to a class of codes called maximum recoverable codes.
Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Locally Recoverable Codes"

1

Barg, Alexander, Kathryn Haymaker, Everett W. Howe, Gretchen L. Matthews i Anthony Várilly-Alvarado. "Locally Recoverable Codes from Algebraic Curves and Surfaces". W Association for Women in Mathematics Series, 95–127. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-63931-4_4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Mesnager, Sihem. "On Good Polynomials over Finite Fields for Optimal Locally Recoverable Codes". W Codes, Cryptology and Information Security, 257–68. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-16458-4_15.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Heng, Ziling, i Xiaoru Li. "Near MDS Codes with Dimension 4 and Their Application in Locally Recoverable Codes". W Arithmetic of Finite Fields, 142–58. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-22944-2_8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Locally Recoverable Codes"

1

Mazumdar, Arya. "Capacity of Locally Recoverable Codes". W 2018 IEEE Information Theory Workshop (ITW). IEEE, 2018. http://dx.doi.org/10.1109/itw.2018.8613529.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Barg, Alexander, Itzhak Tamo i Serge Vladut. "Locally recoverable codes on algebraic curves". W 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, 2015. http://dx.doi.org/10.1109/isit.2015.7282656.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Tamo, Itzhak, i Alexander Barg. "A family of optimal locally recoverable codes". W 2014 IEEE International Symposium on Information Theory (ISIT). IEEE, 2014. http://dx.doi.org/10.1109/isit.2014.6874920.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Bhadane, Sourbh, i Andrew Thangaraj. "Unequal locality and recovery for Locally Recoverable Codes with availability". W 2017 Twenty-third National Conference on Communications (NCC). IEEE, 2017. http://dx.doi.org/10.1109/ncc.2017.8077091.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Senger, Christian, i Harsha Kadalveni Shivakumar. "Subfield Subcodes of Tamo–Barg Locally Recoverable Codes". W 2018 29th Biennial Symposium on Communications (BSC). IEEE, 2018. http://dx.doi.org/10.1109/bsc.2018.8494698.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Huang, Pengfei, Eitan Yaakobi i Paul H. Siegel. "Multi-erasure locally recoverable codes over small fields". W 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2017. http://dx.doi.org/10.1109/allerton.2017.8262863.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Ramkumar, Vinayak, Myna Vajha i P. Vijay Kumar. "Locally Recoverable Streaming Codes for Packet-Erasure Recovery". W 2021 IEEE Information Theory Workshop (ITW). IEEE, 2021. http://dx.doi.org/10.1109/itw48936.2021.9611509.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Tamo, Itzhak, i Alexander Barg. "Bounds on locally recoverable codes with multiple recovering sets". W 2014 IEEE International Symposium on Information Theory (ISIT). IEEE, 2014. http://dx.doi.org/10.1109/isit.2014.6874921.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Cadambe, Viveck, i Arya Mazumdar. "An upper bound on the size of locally recoverable codes". W 2013 International Symposium on Network Coding (NetCod). IEEE, 2013. http://dx.doi.org/10.1109/netcod.2013.6570829.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Garrison, Clifton, Giacomo Micheli, Logan Nott, Vincenzo Pallozzi Lavorante i Phillip Waitkevich. "On a Class of Optimal Locally Recoverable Codes with Availability". W 2023 IEEE International Symposium on Information Theory (ISIT). IEEE, 2023. http://dx.doi.org/10.1109/isit54713.2023.10206840.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Locally Recoverable Codes” dla poszczególnych typów źródeł:
Artykuły w czasopismach
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii