Zobrazeno 1 - 10
of 78
pro vyhledávání: '"Hurley, Ted"'
Autor:
Hurley, Ted
Unit derived schemes applied to Hadamard matrices are used to construct and analyse linear block and convolutional codes. Codes are constructed to prescribed types, lengths and rates and multiple series of self-dual, dual-containing, linear complemen
Externí odkaz:
http://arxiv.org/abs/2410.24027
Autor:
Hurley, Ted
Codes considered as structures within unit schemes greatly extends the availability of linear block and convolutional codes and allows the construction of these codes to required length, rate, distance and type. Properties of a code emanate from prop
Externí odkaz:
http://arxiv.org/abs/2403.01491
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
Publikováno v:
In: Arai, K. (eds) Intelligent Computing. SAI 2022, pp 129-157, Lecture Notes in Networks and Systems, vol 507. Springer, pp 129-157 (2022)
Algebraic methods for the design of series of maximum distance separable (MDS) linear block and convolutional codes to required specifications and types are presented. Algorithms are given to design codes to required rate and required error-correctin
Externí odkaz:
http://arxiv.org/abs/2109.06721
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
Autor:
Hurley, Ted
Publikováno v:
Special Matrices, Vol. 9, 52-65, 2021
Basic matrices are defined which provide unique building blocks for the class of normal matrices which include the classes of unitary and Hermitian matrices. Unique builders for quantum logic gates are hence derived since a quantum logic gates is rep
Externí odkaz:
http://arxiv.org/abs/1904.11250
Autor:
Hurley, Ted
The mds (maximum distance separable) conjecture claims that a nontrivial linear mds $[n,k]$ code over the finite field $GF(q)$ satisfies $n \leq (q + 1)$, except when $q$ is even and $k = 3$ or $k = q- 1$ in which case it satisfies $n \leq (q + 2)$.
Externí odkaz:
http://arxiv.org/abs/1903.05265
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
Autor:
Hurley, Ted
Linear complementary dual (LCD) maximum distance separable (MDS) codes are constructed to given specifications. For given $n$ and $r
Externí odkaz:
http://arxiv.org/abs/1901.04241
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