 | 2008 |
|---|
| 14 |       | Tony Thomas,
Arbind K. Lal:
A Zero-knowledge Undeniable Signature Scheme in Non-abelian Group Setting.
I. J. Network Security 6(3): 265-269 (2008) |
| 2007 |
|---|
| 13 | | Heeralal Janwa,
Arbind K. Lal:
On Generalized Hamming Weights and the Covering Radius of Linear Codes.
AAECC 2007: 347-356 |
| 2006 |
|---|
| 12 | | Tony Thomas,
Arbind K. Lal:
Undeniable Signature Schemes Using Braid Groups
CoRR abs/cs/0601049: (2006) |
| 11 | | Tony Thomas,
Arbind K. Lal:
Group Signature Schemes Using Braid Groups
CoRR abs/cs/0602063: (2006) |
| 2005 |
|---|
| 10 | | Manish K. Gupta,
Mahesh C. Bhandari,
Arbind K. Lal:
On Linear Codes over Z2s.
Des. Codes Cryptography 36(3): 227-244 (2005) |
| 2004 |
|---|
| 9 | | Heeralal Janwa,
Arbind K. Lal:
On Expanders Graphs: Parameters and Applications
CoRR cs.IT/0406048: (2004) |
| 2003 |
|---|
| 8 | | Heeralal Janwa,
Arbind K. Lal:
On Tanner Codes: Minimum Distance and Decoding.
Appl. Algebra Eng. Commun. Comput. 13(5): 335-347 (2003) |
| 1999 |
|---|
| 7 | | Mahesh C. Bhandari,
Manish K. Gupta,
Arbind K. Lal:
On Z4-Simplex Codes and Their Gray Images.
AAECC 1999: 170-180 |
| 6 | | K. K. P. Chanduka,
Mahesh C. Bhandari,
Arbind K. Lal:
Lower Bounds for Group Covering Designs.
AAECC 1999: 334-345 |
| 5 |  | Mahesh C. Bhandari,
Manish K. Gupta,
Arbind K. Lal:
Some Results on NQR Codes.
Des. Codes Cryptography 16(1): 5-9 (1999) |
| 1998 |
|---|
| 4 | | Mahesh C. Bhandari,
K. K. P. Chanduka,
Arbind K. Lal:
On Lower Bounds For Covering Codes.
Des. Codes Cryptography 15(3): 237-243 (1998) |
| 1997 |
|---|
| 3 | | Arbind K. Lal:
Some Games related to Permutation Group Statistics and their type B Analogues.
Ars Comb. 45: (1997) |
| 2 | | Heeralal Janwa,
Arbind K. Lal:
On the generalized Hamming weights of cyclic codes.
IEEE Transactions on Information Theory 43(1): 299-307 (1997) |
| 1 | | K. Chakraborty,
Arbind K. Lal,
B. Ramakrishnan:
Modular forms which behave like theta series.
Math. Comput. 66(219): 1169-1183 (1997) |
