Zobrazeno 1 - 10
of 47
pro vyhledávání: '"David G. Glynn"'
Autor:
Adel N. Alahmadi, Husain S. Alhazmi, Hatoon Shoaib, David G. Glynn, Saeed Ur Rehman, Patrick Solé
Publikováno v:
Mathematics, Vol 11, Iss 12, p 2774 (2023)
Linear codes with complementary duals, or LCD codes, have recently been applied to side-channel and fault injection attack-resistant cryptographic countermeasures. We explain that over characteristic two fields, they exist whenever the permanent of a
Externí odkaz:
https://doaj.org/article/6c2f99be09fd44fead90a6ffe4438ee4
Autor:
Mohd Arif Raza, Adel N. Alahmadi, Widyan Basaffar, David G. Glynn, Manish K. Gupta, James W. P. Hirschfeld, Abdul Nadim Khan, Hatoon Shoaib, Patrick Solé
Publikováno v:
Mathematics, Vol 11, Iss 10, p 2310 (2023)
Quantum codes are crucial building blocks of quantum computers. With a self-dual quantum code is attached, canonically, a unique stabilised quantum state. Improving on a previous publication, we show how to determine the coefficients on the basis of
Externí odkaz:
https://doaj.org/article/e12fecd3938d420b87330c5ff00343bb
Autor:
Adel N. Alahmadi, Saeed Ur Rehman, Husain S. Alhazmi, David G. Glynn, Hatoon Shoaib, Patrick Solé
Publikováno v:
Sensors, Vol 22, Iss 9, p 3520 (2022)
The invention of smart low-power devices and ubiquitous Internet connectivity have facilitated the shift of many labour-intensive jobs into the digital domain. The shortage of skilled workforce and the growing food demand have led the agriculture sec
Externí odkaz:
https://doaj.org/article/c9b49c55792a4c569d5c71ec2fcca216
Autor:
Solé, Adel N. Alahmadi, Husain S. Alhazmi, Hatoon Shoaib, David G. Glynn, Saeed Ur Rehman, Patrick
Publikováno v:
Mathematics; Volume 11; Issue 12; Pages: 2774
Linear codes with complementary duals, or LCD codes, have recently been applied to side-channel and fault injection attack-resistant cryptographic countermeasures. We explain that over characteristic two fields, they exist whenever the permanent of a
Autor:
David G. Glynn, Adel Alahmadi
Publikováno v:
Finite Fields and Their Applications. 44:18-21
Many important graphs are bipartite and cubic (i.e. bipartite and trivalent, or “bicubic”). We explain concisely how the Hamilton cycles of this type of graph are characterized by a single determinantal condition over GF ( 2 ) . Thus algebra may
Autor:
David G. Glynn, Adel Alahmadi
Publikováno v:
Papers and Proceedings of the Royal Society of Tasmania. 150:31-38
In August 2015 NORDITA (Nordic Institute for Theoretical Physics) hosted a conference where Hawking strongly supported the conjectured relationship between string theory and quantum fields that was initiated with the holographic principle some 20 yea
Autor:
David G. Glynn
Publikováno v:
ISRN Geometry. 2013:1-9
Copyright © 2013 David G. Glynn. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Publikováno v:
Beelen, P, Glynn, D, Høholdt, T & Kaipa, K 2017, ' Counting generalized Reed-Solomon codes ', Advances in Mathematics of Communication, vol. 11, no. 4, pp. 777--790 . https://doi.org/10.3934/amc.2017057
In this article we count the number of generalized Reed-Solomon (GRS) codes of dimension k and length n, including the codes coming from a non-degenerate conic plus nucleus. We compare our results with known formulae for the number of 3-dimensional M
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9401e11283e39698d09acf07aca8539b
http://arxiv.org/abs/1611.04341
http://arxiv.org/abs/1611.04341
Autor:
David G. Glynn
Publikováno v:
Designs, Codes and Cryptography. 68:39-47
The two formulae for the permanent of a d × d matrix given by Ryser (1963) and Glynn (2010) fit into a similar pattern that allows generalization because both are related to polarization identities for symmetric tensors, and to the classical theorem
Autor:
David G. Glynn, David Byatt
Publikováno v:
SIAM Journal on Discrete Mathematics. 26:1076-1087
We consider orthogonal arrays of strength two and even order $q$ having $n$ columns which are equivalent to $n-2$ mutually orthogonal Latin squares of order $q$. We show that such structures induce graphs on $n$ vertices, invariant up to complementat