Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Ray, Hill"'
Autor:
Ray Hill, Emil Kolev
Publikováno v:
Combinatorial Designs and their Applications ISBN: 9781315139722
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba74a2378e4c89077e7b85c308d9d060
https://doi.org/10.1201/9781315139722-7
https://doi.org/10.1201/9781315139722-7
Autor:
Laurie Ray Hill
From the moment she holds her baby niece, Rose is on a mission. Terrified that her baby niece will fall victim to the sexual abuse rampant in the family, Rose tells us in her own warm, funny, down-to-earth voice, how she reluctantly agrees to join a
Autor:
Harold N. Ward, Ray Hill
Publikováno v:
Designs, Codes and Cryptography. 44:169-196
We develop a geometric framework for the determination of codes meeting the Griesmer bound that involves a classification of ((q + 1)x, x) generalized minihypers in PG(2, q). These are multisets: each point of the plane has a multiplicity, and the st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66245f4a3e6c64aafba9377a0f4d7b6d
https://doi.org/10.1007/s10623-007-9086-1
https://doi.org/10.1007/s10623-007-9086-1
Autor:
Ray Hill
Publikováno v:
Paediatric and Perinatal Epidemiology. 18:320-326
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::759332b79a88d45f9c856fb3c38ec89b
https://doi.org/10.1111/j.1365-3016.2004.00560.x
https://doi.org/10.1111/j.1365-3016.2004.00560.x
Publikováno v:
Designs, Codes and Cryptography. 29:165-175
In this paper, we prove the nonexistence of Griesmer codes over the field of five elements for k e 4 and d e 33, 83, 163, 164.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6519eb9b0bdd435b38873396326c28d5
https://doi.org/10.1023/a:1024108609872
https://doi.org/10.1023/a:1024108609872
Publikováno v:
Designs, Codes and Cryptography. 24:205-224
A (k,n)-arc in {\rm PG}(2,q) is usually defined to be a set \mathcal{K} of k points in the plane such that some line meets \mathcal{K} in n points but such that no line meets \mathcal{K} in more than n points. There is an extensive literature on the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5e75e462da1b03472b302a282ae36fb
https://doi.org/10.1023/a:1011260806005
https://doi.org/10.1023/a:1011260806005
Publikováno v:
Journal of Geometry. 67:127-144
It is known that the largest size of cap in PG(5, 3) is 56, but very little is known about complete caps of smaller size; the previously known complete caps withk < 56 all had size at most 43. In this paper we construct complete 48-caps and show that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7d6edbd2ba35667468e3dfbb4fa5743
https://doi.org/10.1007/bf01220305
https://doi.org/10.1007/bf01220305
Publikováno v:
Discrete Mathematics. :483-489
In this article we improve the lower bound for K2(9, 1), the minimum cardinality of a binary code of length 9 and covering radius 1. We show that a binary code of length 9, 55 codewords and covering radius 1 does not exist which gives a new lower bou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4a8fc25b712ee7d69f4e8b05c076c63b
https://doi.org/10.1016/s0012-365x(99)90103-6
https://doi.org/10.1016/s0012-365x(99)90103-6
Autor:
Ray Hill
Publikováno v:
Designs, Codes and Cryptography. 17:151-157
One of the first results one meets in coding theory is that a binary linear [n,k,d ] code, whose minimum distance is odd, can be extended to an [ n+1,k,d+1] code. This is one of the few elementary results about binary codes which does not obviously g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35d967cdc23e697253f6a80c81242049
https://doi.org/10.1023/a:1008319024396
https://doi.org/10.1023/a:1008319024396
Autor:
Ray Hill
Publikováno v:
Results in Mathematics. 32:254-259
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cdd243c9f9fcbea3731fcaa79c62a7ef
https://doi.org/10.1007/bf03322134
https://doi.org/10.1007/bf03322134