Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Olav Geil"'
Autor:
Daniel E. Lucani, Morten Videbaek Pedersen, Diego Ruano, Chres W. Sorensen, Frank H. P. Fitzek, Janus Heide, Olav Geil, Vu Nguyen, Martin Reisslein
Publikováno v:
IEEE Access, Vol 6, Pp 77890-77910 (2018)
We introduce Fulcrum, a network coding framework that achieves three seemingly conflicting objectives: 1) to reduce the coding coefficient overhead down to nearly n bits per packet in a generation of n packets; 2) to conduct the network coding using
Externí odkaz:
https://doaj.org/article/63de7725f2a544109b39241f08085663
Autor:
Daniel E. Lucani, Morten V. Pedersen, Diego Ruano, Chres W. Sorensen, Frank H. P. Fitzek, Janus Heide, Olav Geil, Vu Nguyen, Martin Reisslein
Publikováno v:
IEEE Access, Vol 9, Pp 108199-108199 (2021)
In the above article [1], in Section II-B.1)a, titled “Outer Encoding,” the first sentence of the second paragraph should be corrected to consistently use $\Omega _{j}$ to denote the coded packets, i.e., this sentence should state: “For systema
Externí odkaz:
https://doaj.org/article/51428df44955483ca9336fa711ab33e1
Autor:
Olav Geil
Publikováno v:
Geil, O 2022, ' From primary to dual affine variety codes over the Klein quartic ', Designs, Codes, and Cryptography, vol. 90, no. 3, pp. 523-543 . https://doi.org/10.1007/s10623-021-00990-5
In Geil and Özbudak (Cryptogr Commun 11(2):237–257, 2019) a novel method was established to estimate the minimum distance of primary affine variety codes and a thorough treatment of the Klein quartic led to the discovery of a family of primary cod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::557daa3002478ceb3f711877f7adb5f7
https://vbn.aau.dk/da/publications/df5a3b97-6fd8-41d8-b005-975d0269d0dc
https://vbn.aau.dk/da/publications/df5a3b97-6fd8-41d8-b005-975d0269d0dc
Publikováno v:
Galindo, C, Geil, H O, Hernando, F & Ruano Benito, D 2019, ' New binary and ternary LCD codes ', I E E E Transactions on Information Theory, vol. 65, no. 2, 8356685, pp. 1008-1016 . https://doi.org/10.1109/TIT.2018.2834500
UVaDOC. Repositorio Documental de la Universidad de Valladolid
instname
Repositori Universitat Jaume I
Universitat Jaume I
UVaDOC. Repositorio Documental de la Universidad de Valladolid
instname
Repositori Universitat Jaume I
Universitat Jaume I
Producción Científica
LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field wit
LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field wit
Autor:
Janus Heide, Chres W. Sorensen, Olav Geil, Diego Ruano, Morten V. Pedersen, Frank H. P. Fitzek, Vu Nguyen, Martin Reisslein, Daniel E. Lucani
Publikováno v:
Lucani, D E, Pedersen, M V, Ruano, D, Sorensen, C W, Fitzek, F H P, Heide, J, Geil, O, Nguyen, V & Reisslein, M 2021, ' Correction to “Fulcrum : Flexible Network Coding for Heterogeneous Devices" ', IEEE Access, vol. 9, 9508808, pp. 108199-108199 . https://doi.org/10.1109/ACCESS.2021.3101355
In the above article [1] , in Section II-B.1)a, titled “Outer Encoding,” the first sentence of the second paragraph should be corrected to consistently use $\Omega _{j}$ to denote the coded packets, i.e., this sentence should state: “For system
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24b53febeb854463c696c76641cf50ab
https://vbn.aau.dk/da/publications/0c1711ec-e096-47dc-8a9a-773a255226e2
https://vbn.aau.dk/da/publications/0c1711ec-e096-47dc-8a9a-773a255226e2
Publikováno v:
Beelen, P, Geil, O, Martínez-Moro, E & Wu, X W 2020, ' Foreword—Special Issue : Codes, Cryptology and Curves in honour of Ruud Pellikaan ', Designs, Codes, and Cryptography, vol. 88, no. 8, pp. 1477-1478 . https://doi.org/10.1007/s10623-020-00780-5
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ee30bfa1725607389f4d913587bc2ab
https://vbn.aau.dk/da/publications/6ae26ca0-d250-4ef1-a713-82af721f3f2a
https://vbn.aau.dk/da/publications/6ae26ca0-d250-4ef1-a713-82af721f3f2a
Autor:
Olav Geil, René Bødker Christensen
Publikováno v:
Christensen, R B & Geil, O 2020, ' On Steane-enlargement of quantum codes from Cartesian product point sets ', Quantum Information Processing, vol. 19, no. 7, 192 . https://doi.org/10.1007/s11128-020-02691-9
In this work, we study quantum error-correcting codes obtained by using Steane-enlargement. We apply this technique to certain codes defined from Cartesian products previously considered by Galindo et al. in [4]. We give bounds on the dimension incre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16e65301f3b3acd841eff64de6e4ee5a
https://vbn.aau.dk/da/publications/3f99bcdc-c5e4-4fe0-9b56-4c9e3517b7a5
https://vbn.aau.dk/da/publications/3f99bcdc-c5e4-4fe0-9b56-4c9e3517b7a5
Autor:
Umberto Martínez-Peñas, Olav Geil
Publikováno v:
Geil, H O & Martinez Peñas, U 2019, ' Bounding the number of common zeros of multivariate polynomials and their consecutive derivatives ', Combinatorics, Probability & Computing, vol. 28, no. 2, pp. 253-279 . https://doi.org/10.1017/S0963548318000342
We upper-bound the number of common zeros over a finite grid of multivariate polynomials and an arbitrary finite collection of their consecutive Hasse derivatives (in a coordinate-wise sense). To that end, we make use of the tool from Gröbner basis
Autor:
Ferruh Özbudak, Olav Geil
Publikováno v:
Geil, H O & Ozbudak, F 2019, ' On affine variety codes from the Klein quartic ', Cryptography and Communications, vol. 11, no. 2, pp. 237-257 . https://doi.org/10.1007/s12095-018-0285-6
We study a family of primary affine variety codes defined from the Klein quartic. The duals of these codes have previously been treated in Kolluru et al., (Appl. Algebra Engrg. Comm. Comput. 10(6):433–464, 2000, Ex. 3.2). Among the codes that we co
Autor:
Stefano Martin, Olav Geil
Publikováno v:
Advances in Mathematics of Communications. 11:503-531
Coset constructions of q-ary Reed-Muller codes can be used to store secrets on a distributed storage system in such a way that only parties with access to a large part of the system can obtain information while still allowing for local error-correcti