Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Grezet, Matthias"'
In this paper, first steps are taken towards characterising lattices of cyclic flats $\mathcal{Z}(M)$ that belong to matroids $M$ that can be represented over a prescribed finite field $\mathbb{F}_q$. Two natural maps from $\mathcal{Z}(M)$ to the lat
Externí odkaz:
http://arxiv.org/abs/1906.10936
Publikováno v:
IEEE Communications Letters, May 2019
In this letter, locally recoverable codes with maximal recoverability are studied with a focus on identifying the MDS codes resulting from puncturing and shortening. By using matroid theory and the relation between MDS codes and uniform minors, the l
Externí odkaz:
http://arxiv.org/abs/1906.02423
Autor:
Grezet, Matthias, Hollanti, Camilla
This paper presents a new alphabet-dependent bound for codes with hierarchical locality. Then, the complete list of possible localities is derived for a class of codes obtained by deleting specific columns from a Simplex code. This list is used to sh
Externí odkaz:
http://arxiv.org/abs/1901.03149
Publikováno v:
IEEE Transactions on Information Theory, April 2019
Locally repairable codes (LRCs) have gained significant interest for the design of large distributed storage systems as they allow a small number of erased nodes to be recovered by accessing only a few others. Several works have thus been carried out
Externí odkaz:
http://arxiv.org/abs/1810.08510
Autor:
Grezet, Matthias, Freij-Hollanti, Ragnar, Westerbäck, Thomas, Olmez, Oktay, Hollanti, Camilla
Recently, locally repairable codes has gained significant interest for their potential applications in distributed storage systems. However, most constructions in existence are over fields with size that grows with the number of servers, which makes
Externí odkaz:
http://arxiv.org/abs/1709.05801
Publikováno v:
Coding Theory and Applications, 5 ICMCTA (2017). Proceedings, pp. 139-153
Locally repairable codes for distributed storage systems have gained a lot of interest recently, and various constructions can be found in the literature. However, most of the constructions result in either large field sizes and hence too high comput
Externí odkaz:
http://arxiv.org/abs/1707.00421
Publikováno v:
In Advances in Applied Mathematics June 2021 127
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Grezet, Matthias, Hollanti, Camilla
Publikováno v:
Designs, Codes & Cryptography; 2021, Vol. 89 Issue 1, p105-125, 21p