Dwijendra K. Ray-Chaudhuri

According to our database1, Dwijendra K. Ray-Chaudhuri authored at least 31 papers between 1960 and 2012.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
Studying designs via multisets.
Des. Codes Cryptogr., 2012

2007
Simple 3-designs and PSL(2, q) with q == 1 (mod 4).
Des. Codes Cryptogr., 2007

2006
Determination of all possible orders of weight 16 circulant weighing matrices.
Finite Fields Their Appl., 2006

Foreword.
Discret. Math., 2006

Circulant weighing matrices of weight 2<sup>2<i>t</i></sup>.
Des. Codes Cryptogr., 2006

2004
On some classes of optimal and near-optimal polynomial codes.
Finite Fields Their Appl., 2004

2003
Preface: Volume 15.
Electron. Notes Discret. Math., 2003

2002
New linear codes over F<sub>5</sub> obtained by tripling method and improvements on bounds.
IEEE Trans. Inf. Theory, 2002

Quasi-cyclic codes over Z<sub>4</sub> and some new binary codes.
IEEE Trans. Inf. Theory, 2002

An Existence Theorem for Group Divisible Designs of Large Order.
J. Comb. Theory, Ser. A, 2002

2001
A Construction for Infinite Families of Steiner 3-Designs.
J. Comb. Theory, Ser. A, 2001

The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes.
Des. Codes Cryptogr., 2001

2000
New ternary quasi-cyclic codes with better minimum distances.
IEEE Trans. Inf. Theory, 2000

A transform approach to permutation groups of cyclic codes over Galois rings.
IEEE Trans. Inf. Theory, 2000

New Linear Codes Over and and Improvements on Bounds.
Des. Codes Cryptogr., 2000

1999
New 1-generator quasi-twisted codes over <i>GF</i>(5).
Proceedings of the Codes and Association Schemes, 1999

1997
Frankl-Füredi Type Inequalities for Polynomial Semi-lattices.
Electron. J. Comb., 1997

1996
Constructions of Partial Difference Sets and Relative Difference Sets Using Galois Rings II.
J. Comb. Theory, Ser. A, 1996

Constructions of Partial Difference Sets and Relative Difference Sets Using Galois Rings.
Des. Codes Cryptogr., 1996

1994
Theory and Design of t-Unidirectional Error-Correcting and d-Unidirectional Error-Detecting Code.
IEEE Trans. Computers, 1994

1992
A recursive method for construction of designs.
Discret. Math., 1992

1988
On Existence of t-Designs with Large v and lambda.
SIAM J. Discret. Math., 1988

On existence and number of orthogonal arrays.
J. Comb. Theory, Ser. A, 1988

1984
Hall Triple Systems and Commutative Moufang Exponent 3 Loops: The Case of Nilpotence Class 2.
J. Comb. Theory, Ser. A, 1984

1982
Embedding of a Pseudo-residual Design into a Möbius Plane.
J. Comb. Theory, Ser. A, 1982

Intersection theorems for group divisible difference sets.
Discret. Math., 1982

1981
Multiplier Theorems.
J. Comb. Theory, Ser. A, 1981

1972
On resolvable designs.
Discret. Math., 1972

1968
File Organization Schemes Based on Finite Geometries
Inf. Control., February, 1968

1960
Further Results on Error Correcting Binary Group Codes
Inf. Control., September, 1960

On A Class of Error Correcting Binary Group Codes
Inf. Control., March, 1960


  Loading...