Arbind K. Lal

According to our database, Arbind K. Lal authored at least 14 papers between 1997 and 2008.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2008

A Zero-knowledge Undeniable Signature Scheme in Non-abelian Group Setting.

Tony Thomas, Arbind K. Lal

Int. J. Netw. Secur., 2008

2007

On Generalized Hamming Weights and the Covering Radius of Linear Codes.

Heeralal Janwa, Arbind K. Lal

Proceedings of the Applied Algebra, 2007

2006

Group Signature Schemes Using Braid Groups

Tony Thomas, Arbind K. Lal

CoRR, 2006

Undeniable Signature Schemes Using Braid Groups

Tony Thomas, Arbind K. Lal

CoRR, 2006

2005

On Linear Codes over Z_2^s.

Manish K. Gupta, Mahesh C. Bhandari, Arbind K. Lal

Des. Codes Cryptogr., 2005

2004

On Expanders Graphs: Parameters and Applications

Heeralal Janwa, Arbind K. Lal

CoRR, 2004

2003

On Tanner Codes: Minimum Distance and Decoding.

Heeralal Janwa, Arbind K. Lal

Appl. Algebra Eng. Commun. Comput., 2003

1999

Some Results on NQR Codes.

Mahesh C. Bhandari, Manish K. Gupta, Arbind K. Lal

Des. Codes Cryptogr., 1999

Lower Bounds for Group Covering Designs.

K. K. P. Chanduka, Mahesh C. Bhandari, Arbind K. Lal

Proceedings of the Applied Algebra, 1999

On Z₄-Simplex Codes and Their Gray Images.

Mahesh C. Bhandari, Manish K. Gupta, Arbind K. Lal

Proceedings of the Applied Algebra, 1999

1998

On Lower Bounds For Covering Codes.

Mahesh C. Bhandari, K. K. P. Chanduka, Arbind K. Lal

Des. Codes Cryptogr., 1998

1997

On the generalized Hamming weights of cyclic codes.

Heeralal Janwa, Arbind K. Lal

IEEE Trans. Inf. Theory, 1997

Modular forms which behave like theta series.

K. Chakraborty, Arbind K. Lal, B. Ramakrishnan

Math. Comput., 1997

Some Games related to Permutation Group Statistics and their type B Analogues.

Arbind K. Lal

Ars Comb., 1997