Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Pellikaan, G.R."'
Algebraic geometry codes have recently been the subject of a great deal of research. This area finds important applications in electronic engineering and computer science as well being of interest to mathematicians. Ruud Pellikaan has written a book
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a573fe52f7a9dff1371d5449adbde8b
https://doi.org/10.1017/9780511982170
https://doi.org/10.1017/9780511982170
Autor:
Utomo, P.H., Pellikaan, G.R.
Publikováno v:
Proceedings of the 2017 Symposium on Information Theory and Signal Processing in the Benelux
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::472468632d50a32c41c6939031ad389b
https://research.tue.nl/nl/publications/a4ab04c0-01d5-453f-8828-c2ef5aaac159
https://research.tue.nl/nl/publications/a4ab04c0-01d5-453f-8828-c2ef5aaac159
Autor:
Márquez-Corbella, I., Pellikaan, G.R.
Error-correcting pairs were introduced in 1988 by R. Pellikaan, and were found independently by R. Kötter (1992), as a general algebraic method of decoding linear codes. These pairs exist for several classes of codes. However little or no study has
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::f79e24cb1606f44eb7f755a5e5879973
https://research.tue.nl/nl/publications/f98ee795-fbeb-480b-aefe-3eea1f6b18ab
https://research.tue.nl/nl/publications/f98ee795-fbeb-480b-aefe-3eea1f6b18ab
Autor:
Jurrius, R.P.M.J., Pellikaan, G.R.
Publikováno v:
AMS Special Session on Hyperplane Arrangements and Applications 2014 (Part of Joint Mathematics Meetings, Baltimore MD, USA, January 15-18, 2014)
Many research in coding theory is focussed on linear error-correcting codes. Since these codes are subspaces, linear algebra plays a prominent role in studying them. An important polynomial invariant of linear error-correcting codes is the (extended)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::49de660e13f4bed4129f71dfe790ad40
https://research.tue.nl/nl/publications/3502171a-882a-4053-8aea-1fabb89d0187
https://research.tue.nl/nl/publications/3502171a-882a-4053-8aea-1fabb89d0187
Publikováno v:
Computer Algebra in Coding Theory and Cryptography (Special Session at 20th Conference on Applications of Computer Algebra, ACA 2014, New York NY, USA, July 9-12, 2014), 1-5
STARTPAGE=1;ENDPAGE=5;TITLE=Computer Algebra in Coding Theory and Cryptography (Special Session at 20th Conference on Applications of Computer Algebra, ACA 2014, New York NY, USA, July 9-12, 2014)
STARTPAGE=1;ENDPAGE=5;TITLE=Computer Algebra in Coding Theory and Cryptography (Special Session at 20th Conference on Applications of Computer Algebra, ACA 2014, New York NY, USA, July 9-12, 2014)
McEliece cryptosystem is the first public-key cryptosystem based on linear error-correcting codes. Although a code with an efficient bounded distance decoding algorithm is chosen as the secret key in this cryptosystem, not knowing the secret code and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::98799073c18267b386e89ed51f70ce99
https://research.tue.nl/nl/publications/5dd5b596-776c-4bc4-9450-5f6b6bcb7e7e
https://research.tue.nl/nl/publications/5dd5b596-776c-4bc4-9450-5f6b6bcb7e7e
Publikováno v:
Journées Codage et Cryptographie 2014 (Les Sept Laux, France, March 24-28, 2014), 1-28
STARTPAGE=1;ENDPAGE=28;TITLE=Journées Codage et Cryptographie 2014 (Les Sept Laux, France, March 24-28, 2014)
STARTPAGE=1;ENDPAGE=28;TITLE=Journées Codage et Cryptographie 2014 (Les Sept Laux, France, March 24-28, 2014)
Sheet presentation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::283d0cfacaf29873bc957cccac4fa890
https://research.tue.nl/nl/publications/2cdea777-1f00-461b-ade2-ce465984730d
https://research.tue.nl/nl/publications/2cdea777-1f00-461b-ade2-ce465984730d
Publikováno v:
Computer Algebra in Coding Theory and Cryptography (Special Session at 20th Conference on Applications of Computer Algebra, ACA 2014, New York NY, USA, July 9-12, 2014), 1-5
STARTPAGE=1;ENDPAGE=5;TITLE=Computer Algebra in Coding Theory and Cryptography (Special Session at 20th Conference on Applications of Computer Algebra, ACA 2014, New York NY, USA, July 9-12, 2014)
STARTPAGE=1;ENDPAGE=5;TITLE=Computer Algebra in Coding Theory and Cryptography (Special Session at 20th Conference on Applications of Computer Algebra, ACA 2014, New York NY, USA, July 9-12, 2014)
This paper investigates the rank weight enumerator of a code over L, where L is a finite extension of a field K. This is a generalization of the case where K = F_q and L = F_{q^m} of Gabidulin codes to arbitrary characteristic. We use the notion of c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::4997f19de9626086006b48ce6f9ce989
https://research.tue.nl/nl/publications/0f5d00c5-79c9-4557-bbd8-c685e807dd31
https://research.tue.nl/nl/publications/0f5d00c5-79c9-4557-bbd8-c685e807dd31
Publikováno v:
Coding Theory and Applications ISBN: 9783319172958
ICMCTA
Coding Theory and Applications: 4th International Castle Meeting, Palmela Castle, Portugal, September 15-18, 2014, 133-140
STARTPAGE=133;ENDPAGE=140;TITLE=Coding Theory and Applications
4th ICMCTA-Fourth International Castle Meeting on Coding Theory and Applications
4th ICMCTA-Fourth International Castle Meeting on Coding Theory and Applications, Sep 2014, Palmela, Portugal
ICMCTA
Coding Theory and Applications: 4th International Castle Meeting, Palmela Castle, Portugal, September 15-18, 2014, 133-140
STARTPAGE=133;ENDPAGE=140;TITLE=Coding Theory and Applications
4th ICMCTA-Fourth International Castle Meeting on Coding Theory and Applications
4th ICMCTA-Fourth International Castle Meeting on Coding Theory and Applications, Sep 2014, Palmela, Portugal
International audience; We give a polynomial time attack on the McEliece public key cryptosystem based on subcodes of algebraic geometry (AG) codes. The proposed attack reposes on the distinguishability of such codes from random codes using the Schur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::54a0b3f567f0241471f143dec3f19ee1
Publikováno v:
Algebraic geometry modeling in information theory, 219-325
STARTPAGE=219;ENDPAGE=325;TITLE=Algebraic geometry modeling in information theory
STARTPAGE=219;ENDPAGE=325;TITLE=Algebraic geometry modeling in information theory
This chapter treats error-correcting codes and their weight enumerator as the center of several closely related topics such as arrangements of hyperplanes, graph theory, matroids, posets and geometric lattices and their characteristic, chromatic, Tut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d0d0b42a046d0c141462d764932e5bdf
https://research.tue.nl/nl/publications/8e6e6d56-5eba-4479-9741-d9027c8259db
https://research.tue.nl/nl/publications/8e6e6d56-5eba-4479-9741-d9027c8259db
Publikováno v:
Proceedings of Applications of Computer Algebra (ACA 2013, Málaga, Spain, July 2-6, 2013), 129-132
STARTPAGE=129;ENDPAGE=132;TITLE=Proceedings of Applications of Computer Algebra (ACA 2013, Málaga, Spain, July 2-6, 2013)
STARTPAGE=129;ENDPAGE=132;TITLE=Proceedings of Applications of Computer Algebra (ACA 2013, Málaga, Spain, July 2-6, 2013)
The security of the most popular number-theory public key crypto (PKC) systems will be devastatingly affected by the success of a large quantum computer. Code-based cryptography is one of the promising alternatives that are believed to resist classic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::f6501337f2874f2da3cfac70bcb317b8
https://research.tue.nl/nl/publications/002bb815-ee67-4528-a1ba-76632ce14ac4
https://research.tue.nl/nl/publications/002bb815-ee67-4528-a1ba-76632ce14ac4