Zobrazeno 1 - 10
of 46
pro vyhledávání: '"HURLEY, BARRY"'
Autor:
HURLEY, TED1 Ted.Hurley@universityofgalway.ie, HURLEY, BARRY2 barryj2000@yahoo.co.uk
Publikováno v:
International Journal of Group Theory. Sep2024, Vol. 13 Issue 3, p271-291. 21p.
Autor:
Hurley, Ted, Hurley, Barry
Publikováno v:
Intl. J Group Theory, Volume 13, Issue 3, 271-291, 2024
Matrices are built and designed by applying procedures from lower order matrices. Matrix tensor products, direct sums or multiplication of matrices are such procedures and a matrix built from these is said to be a {\em separable} matrix. A {\em non-s
Externí odkaz:
http://arxiv.org/abs/2101.00700
Publikováno v:
Global J. Science, Frontier Research, Math. & Division Sc., 21 (4), 11-22, 2021
Maximum distance separable (MDS) are constructed to required specifications. The codes are explicitly given over finite fields with efficient encoding and decoding algorithms. Series of such codes over finite fields with ratio of distance to length a
Externí odkaz:
http://arxiv.org/abs/1902.06624
Entanglement-assisted quantum error-correcting codes (EAQECCs) to desired rate, error-correcting capability and maximum shared entanglement are constructed. Thus for a required rate $R$, required error-correcting capability to correct $t$ errors, mds
Externí odkaz:
http://arxiv.org/abs/1806.10875
Publikováno v:
Intl. Journal of Information and Coding Theory, 2018 Vol.5 No.2, pp.169 - 182
Series of maximum distance quantum error-correcting codes are developed and analysed. For a given rate and given error-correction capability, quantum error-correcting codes with these specifications are constructed. The codes are explicit with effici
Externí odkaz:
http://arxiv.org/abs/1805.09053
Combinatorial decision problems arise in many different domains such as scheduling, routing, packing, bioinformatics, and many more. Despite recent advances in developing scalable solvers, there are still many problems which are often very hard to so
Externí odkaz:
http://arxiv.org/abs/1605.06940
Instance-specific algorithm configuration and algorithm portfolios have been shown to offer significant improvements over single algorithm approaches in a variety of application domains. In the SAT and CSP domains algorithm portfolios have consistent
Externí odkaz:
http://arxiv.org/abs/1401.2474
In recent years, portfolio approaches to solving SAT problems and CSPs have become increasingly common. There are also a number of different encodings for representing CSPs as SAT instances. In this paper, we leverage advances in both SAT and CSP sol
Externí odkaz:
http://arxiv.org/abs/1306.5606
Autor:
Hurley, Barry, Hurley, Ted
Publikováno v:
Discrete Math., Vol 335, 81-91, 2014
Algebraic systems are constructed from which series of maximum distance separable (mds) codes are derived. The methods use unit and idempotent schemes.
Externí odkaz:
http://arxiv.org/abs/1301.5596
Autor:
Hurley, Barry, Hurley, Ted
Design methods for paraunitary matrices from complete orthogonal sets of idempotents and related matrix structures are presented. These include techniques for designing non-separable multidimensional paraunitary matrices. Properties of the structures
Externí odkaz:
http://arxiv.org/abs/1205.0703