Zobrazeno 1 - 10
of 162
pro vyhledávání: '"Zeh, Alexander"'
Generalized Goppa codes are defined by a code locator set $\mathcal{L}$ of polynomials and a Goppa polynomial $G(x)$. When the degree of all code locator polynomials in $\mathcal{L}$ is one, generalized Goppa codes are classical Goppa codes. In this
Externí odkaz:
http://arxiv.org/abs/2102.02831
Autor:
Rieger, Viola, Zeh, Alexander
We propose two parity-based concurrent error detection schemes for the Quarterround of the ChaCha stream cipher to protect from transient and permanent faults. They offer a trade-off between implementation overhead and error coverage. The second appr
Externí odkaz:
http://arxiv.org/abs/1904.06073
In this paper, a code-based public-key cryptosystem based on interleaved Goppa codes is presented. The scheme is based on encrypting several ciphertexts with the same Goppa code and adding a burst error to them. Possible attacks are outlined and the
Externí odkaz:
http://arxiv.org/abs/1809.03024
Autor:
Zeh, Alexander, Yaakobi, Eitan
This paper studies bounds and constructions of locally repairable codes (LRCs) with multiple localities so-called multiple-locality LRCs (ML-LRCs). In the simplest case of two localities some code symbols of an ML-LRC have a certain locality while th
Externí odkaz:
http://arxiv.org/abs/1601.02763
Autor:
Zeh, Alexander
Deux défis de la théorie du codage algébrique sont traités dans cette thèse. Le premier est le décodage efficace (dur et souple) de codes de Reed--Solomon généralisés sur les corps finis en métrique de Hamming. La motivation pour résoudre
Autor:
Zeh, Alexander, Ling, San
This paper considers a linear quasi-cyclic product code of two given quasi-cyclic codes of relatively prime lengths over finite fields. We give the spectral analysis of a quasi-cyclic product code in terms of the spectral analysis of the row- and the
Externí odkaz:
http://arxiv.org/abs/1512.06690
Autor:
Zeh, Alexander, Ulmschneider, Markus
The well-known approach of Bose, Ray-Chaudhuri and Hocquenghem and its generalization by Hartmann and Tzeng are lower bounds on the minimum distance of simple-root cyclic codes. We generalize these two bounds to the case of repeated-root cyclic codes
Externí odkaz:
http://arxiv.org/abs/1506.02820
Autor:
Zeh, Alexander, Yaakobi, Eitan
We consider locally repairable codes over small fields and propose constructions of optimal cyclic and linear codes in terms of the dimension for a given distance and length. Four new constructions of optimal linear codes over small fields with local
Externí odkaz:
http://arxiv.org/abs/1502.06809
Autor:
Silberstein, Natalia, Zeh, Alexander
This paper presents a construction for several families of optimal binary locally repairable codes (LRCs) with small locality (2 and 3). This construction is based on various anticodes. It provides binary LRCs which attain the Cadambe-Mazumdar bound.
Externí odkaz:
http://arxiv.org/abs/1501.07114
Autor:
Zeh, Alexander, Ling, San
Linear quasi-cyclic product codes over finite fields are investigated. Given the generating set in the form of a reduced Gr{\"o}bner basis of a quasi-cyclic component code and the generator polynomial of a second cyclic component code, an explicit ex
Externí odkaz:
http://arxiv.org/abs/1501.06543