Zobrazeno 1 - 10
of 62
pro vyhledávání: '"D.K. Ray-Chaudhuri"'
Autor:
N. M. Singhi, D.K. Ray-Chaudhuri
Publikováno v:
Designs, Codes and Cryptography. 65:365-381
A new method to study families of finite sets, in particular t-designs, by studying families of multisets (also called lists) and their relationships with families of sets, is developed. Notion of the tag for a subset defined earlier by one of the au
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::414ecc905ab34b7153556e92338b9e21
https://doi.org/10.1007/s10623-012-9708-0
https://doi.org/10.1007/s10623-012-9708-0
Autor:
Hedvig Mohácsy, D.K. Ray-Chaudhuri
Publikováno v:
Journal of Statistical Planning and Inference. 109:167-177
The “block spreading” construction takes a group divisible design with large index and yields a group divisible design with larger group size and with index one. This construction is very useful in the construction of Steiner designs. Wilson's
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aacc0a707d9f0a9449d2004bf1cf8f68
https://doi.org/10.1016/s0378-3758(02)00309-9
https://doi.org/10.1016/s0378-3758(02)00309-9
Autor:
D.K. Ray-Chaudhuri, Hedvig Mohácsy
Publikováno v:
Journal of Combinatorial Theory, Series A. 98(1):163-174
In this paper we establish an asymptotic existence result for group divisible 3-designs of large order. Let k and u be positive integers, 3==m"0 if and only if1.u-2=0(mod(k-2)), 2.(u-1)(u-2)=0(mod(k-1)(k-2)), 3.u(u-1)(u-2)=0(modk(k-1)(k-2)). An analo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31d06ded314b1d7ee5c76072b99a8feb
Autor:
D.K. Ray-Chaudhuri, Jin Qian
Publikováno v:
Journal of Statistical Planning and Inference. 95:293-306
In their 1981 paper, Frankl and Wilson gave a non-uniform analog of Ray-Chaudhuri–Wilson Inequality called Frankl–Ray-Chaudhuri–Wilson Inequality. In this paper, we give a complete classification of the extremal case of their theorem. Our prese
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d892669efc3c3af8ebadcf5383942b7
https://doi.org/10.1016/s0378-3758(00)00296-2
https://doi.org/10.1016/s0378-3758(00)00296-2
Autor:
D.K. Ray-Chaudhuri, Qing Xiang
Publikováno v:
Journal of Statistical Planning and Inference. 62:69-79
In this paper, we obtain several nonexistence results for abelian Hadamard difference sets. In particular, we prove that there are no Hadamard difference sets in abelian groups G = Z2 × Z2 × P, where |P| = p2α, α is odd and p is a prime congruent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64ec03a7b7e1ddebeee819d0cd7d000a
https://doi.org/10.1016/s0378-3758(96)00170-x
https://doi.org/10.1016/s0378-3758(96)00170-x
Autor:
D.K. Ray-Chaudhuri, Tianbao Zhu
Publikováno v:
Journal of Statistical Planning and Inference. 58:177-183
In the first part of this paper, we give a short and direct construction of signed orthogonal array SOA( λ , t , k , v ), for any set of parameters λ , t , k , v , t ⩽ k . We also construct a specific basis of the Z -module generated by any SOA(0
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88713c0739780f1aff4363aecfc34c04
https://doi.org/10.1016/s0378-3758(96)00068-7
https://doi.org/10.1016/s0378-3758(96)00068-7
Publikováno v:
Journal of Combinatorial Theory, Series A. 76:179-196
In a previous paper, [Des., Codes and Cryptogr.8(1996), 215–227]; we used Galois rings to construct partial difference sets, relative difference sets and a difference set. In the present paper, we first generalize and improve the construction of pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f841779023d6d52741a1f685094a80ed
https://doi.org/10.1006/jcta.1996.0100
https://doi.org/10.1006/jcta.1996.0100
Publikováno v:
IEEE Transactions on Computers. 43:1221-1226
The basic theory of t-UEC d-UED codes is developed. Methods for construction of such codes from symmetric error-correcting and asymmetric error-correcting codes are developed. Some bounds for t-EC d-UED codes are improved. Encoding/decoding procedure
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f555032b5b80a0cd4f8c08e7e6f18259
https://doi.org/10.1109/12.324547
https://doi.org/10.1109/12.324547
Publikováno v:
Electronic Notes in Discrete Mathematics. 15:1
On the occasion of the birth centenary of Professor Raj Chandra Bose, who made epoch-making contributions to various branches of Mathematics and Statistics, the Indian Statistical Institute organized R. C. Bose Centenary Symposium on Discrete Mathema
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8b712256467d850e0ec246897235ddd
https://doi.org/10.1016/s1571-0653(04)00504-9
https://doi.org/10.1016/s1571-0653(04)00504-9
Autor:
D.K. Ray-Chaudhuri, Robert Roth
Publikováno v:
Journal of Combinatorial Theory, Series A. 36:129-162
We study here the structure of the coordinatizing loops of Hall Triple Systems which are Steiner Triple Systems, other than affine geometries, in which every plane is an affine plane. These loops are necessarily non-associative commutative Moufang lo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d635c74afb9139ef5db619b377dd1722
https://doi.org/10.1016/0097-3165(84)90001-3
https://doi.org/10.1016/0097-3165(84)90001-3