default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDwijendra K. Ray-Chaudhuri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2012
[j31]Navin M. Singhi, Dwijendra K. Ray-Chaudhuri:
Studying designs via multisets. Des. Codes Cryptogr. 65(3): 365-381 (2012)- 2007
- [j30]Niranjan Balachandran, Dijen K. Ray-Chaudhuri:
Simple 3-designs and PSL(2, q) with q == 1 (mod 4). Des. Codes Cryptogr. 44(1-3): 263-274 (2007) - 2006
- [j29]K. T. Arasu, Ka Hin Leung, Siu Lun Ma, Ali Nabavi
, Dwijendra K. Ray-Chaudhuri:
Circulant weighing matrices of weight 22t. Des. Codes Cryptogr. 41(1): 111-123 (2006) - [j28]Haim Hanani, Dwijendra K. Ray-Chaudhuri, Richard M. Wilson:
On resolvable designs. Discret. Math. 306(10-11): 876-885 (2006) - [j27]Bimal Kumar Roy, A. R. Rao, Dwijendra K. Ray-Chaudhuri:
Foreword. Discret. Math. 306(14): 1463 (2006) - [j26]K. T. Arasu, Ka Hin Leung, Siu Lun Ma, Ali Nabavi, Dwijendra K. Ray-Chaudhuri:
Determination of all possible orders of weight 16 circulant weighing matrices. Finite Fields Their Appl. 12(4): 498-538 (2006) - 2004
- [j25]Nuh Aydin, Dijen K. Ray-Chaudhuri:
On some classes of optimal and near-optimal polynomial codes. Finite Fields Their Appl. 10(1): 24-35 (2004) - 2003
- [j24]Dwijendra K. Ray-Chaudhuri, A. R. Rao, Bimal Kumar Roy:
Preface: Volume 15. Electron. Notes Discret. Math. 15: 1 (2003) - 2002
- [j23]Hedvig Mohácsy, Dwijendra K. Ray-Chaudhuri:
An Existence Theorem for Group Divisible Designs of Large Order. J. Comb. Theory A 98(1): 163-174 (2002) - [j22]Nuh Aydin, Dwijendra K. Ray-Chaudhuri:
Quasi-cyclic codes over Z4 and some new binary codes. IEEE Trans. Inf. Theory 48(7): 2065-2069 (2002) - [j21]Irfan Siap, Dwijendra K. Ray-Chaudhuri:
New linear codes over F5 obtained by tripling method and improvements on bounds. IEEE Trans. Inf. Theory 48(10): 2764-2768 (2002) - 2001
- [j20]Nuh Aydin, Irfan Siap, Dwijendra K. Ray-Chaudhuri:
The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes. Des. Codes Cryptogr. 24(3): 313-326 (2001) - [j19]Hedvig Mohácsy, Dwijendra K. Ray-Chaudhuri:
A Construction for Infinite Families of Steiner 3-Designs. J. Comb. Theory A 94(1): 127-141 (2001) - 2000
- [j18]Irfan Siap, Dwijendra K. Ray-Chaudhuri:
New Linear Codes Over and and Improvements on Bounds. Des. Codes Cryptogr. 21(1/3): 223-233 (2000) - [j17]Irfan Siap, Nuh Aydin, Dwijendra K. Ray-Chaudhuri:
New ternary quasi-cyclic codes with better minimum distances. IEEE Trans. Inf. Theory 46(4): 1554-1558 (2000) - [j16]Jason Thomas Blackford, Dwijendra K. Ray-Chaudhuri:
A transform approach to permutation groups of cyclic codes over Galois rings. IEEE Trans. Inf. Theory 46(7): 2350-2358 (2000) - 1997
- [j15]Jin Qian, Dijen K. Ray-Chaudhuri:
Frankl-Füredi Type Inequalities for Polynomial Semi-lattices. Electron. J. Comb. 4(1) (1997) - 1996
- [j14]Dwijendra K. Ray-Chaudhuri, Qing Xiang:
Constructions of Partial Difference Sets and Relative Difference Sets Using Galois Rings. Des. Codes Cryptogr. 8(1-2): 215-227 (1996) - [j13]Yu Qing Chen, Dwijendra K. Ray-Chaudhuri, Qing Xiang:
Constructions of Partial Difference Sets and Relative Difference Sets Using Galois Rings II. J. Comb. Theory A 76(2): 179-196 (1996) - 1994
- [j12]Dwijendra K. Ray-Chaudhuri, Navin M. Singhi, S. Sanyal, P. S. Subramanian:
Theory and Design of t-Unidirectional Error-Correcting and d-Unidirectional Error-Detecting Code. IEEE Trans. Computers 43(10): 1221-1226 (1994) - 1992
- [j11]Dwijendra K. Ray-Chaudhuri, Tianbao Zhu:
A recursive method for construction of designs. Discret. Math. 106-107: 399-406 (1992) - 1988
- [j10]Dwijendra K. Ray-Chaudhuri, Navin M. Singhi:
On existence and number of orthogonal arrays. J. Comb. Theory A 47(1): 28-36 (1988) - [j9]Dwijendra K. Ray-Chaudhuri, Navin M. Singhi:
On Existence of t-Designs with Large v and lambda. SIAM J. Discret. Math. 1(1): 98-104 (1988) - 1984
- [j8]Robert Roth, Dwijendra K. Ray-Chaudhuri:
Hall Triple Systems and Commutative Moufang Exponent 3 Loops: The Case of Nilpotence Class 2. J. Comb. Theory A 36(2): 129-162 (1984) - 1982
- [j7]Hai-Ping Ko, Dijen K. Ray-Chaudhuri:
Intersection theorems for group divisible difference sets. Discret. Math. 39(1): 37-58 (1982) - [j6]Agnes Hui Chan, Dwijendra K. Ray-Chaudhuri:
Embedding of a Pseudo-residual Design into a Möbius Plane. J. Comb. Theory A 32(1): 73-98 (1982) - 1981
- [j5]Hai-Ping Ko, Dijen K. Ray-Chaudhuri:
Multiplier Theorems. J. Comb. Theory A 30(2): 134-157 (1981) - 1972
- [j4]Haim Hanani, Dwijendra K. Ray-Chaudhuri, Richard M. Wilson:
On resolvable designs. Discret. Math. 3(4): 343-357 (1972) - 1968
- [j3]Chacko T. Abraham, Sakti P. Ghosh, Dwijendra K. Ray-Chaudhuri:
File Organization Schemes Based on Finite Geometries. Inf. Control. 12(2): 143-163 (1968) - 1960
- [j2]R. C. Bose, Dwijendra K. Ray-Chaudhuri:
On A Class of Error Correcting Binary Group Codes. Inf. Control. 3(1): 68-79 (1960) - [j1]R. C. Bose, Dwijendra K. Ray-Chaudhuri:
Further Results on Error Correcting Binary Group Codes. Inf. Control. 3(3): 279-290 (1960)
Conference and Workshop Papers
- 1999
- [c1]Irfan Siap, Nuh Aydin, Dijen K. Ray-Chaudhuri:
New 1-generator quasi-twisted codes over GF(5). Codes and Association Schemes 1999: 265-275
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
