2007 |
12 | EE | Heeralal Janwa,
Arbind K. Lal:
On Generalized Hamming Weights and the Covering Radius of Linear Codes.
AAECC 2007: 347-356 |
2004 |
11 | EE | Heeralal Janwa,
Arbind K. Lal:
On Expanders Graphs: Parameters and Applications
CoRR cs.IT/0406048: (2004) |
2003 |
10 | EE | Heeralal Janwa:
Good Expander Graphs and Expander Codes: Parameters and Decoding.
AAECC 2003: 119-128 |
9 | EE | Heeralal Janwa,
Arbind K. Lal:
On Tanner Codes: Minimum Distance and Decoding.
Appl. Algebra Eng. Commun. Comput. 13(5): 335-347 (2003) |
1999 |
8 | | Heeralal Janwa,
H. F. Mattson Jr.:
Some Upper Bounds on the Covering Radii of Linear Codes Over and Their Applications.
Des. Codes Cryptography 18(1/3): 163-181 (1999) |
1997 |
7 | | Heeralal Janwa,
Arbind K. Lal:
On the generalized Hamming weights of cyclic codes.
IEEE Transactions on Information Theory 43(1): 299-307 (1997) |
1996 |
6 | | Heeralal Janwa,
Oscar Moreno:
McEliece Public Key Cryptosystems Using Algebraic-Geometric Codes.
Des. Codes Cryptography 8(3): 293-307 (1996) |
1993 |
5 | | Heeralal Janwa,
Richard M. Wilson:
Hyperplane Sections of Fermat Varieties in P3 in Char.2 and Some Applications to Cyclic Codes.
AAECC 1993: 180-194 |
1991 |
4 | | Heeralal Janwa:
On the Parameters of Algebraic Geometric Codes.
AAECC 1991: 19-28 |
3 | | Huy T. Cao,
Randall L. Dougherty,
Heeralal Janwa:
A [55, 16, 19] binary Goppa code and related codes having large minimum distance.
IEEE Transactions on Information Theory 37(5): 1432- (1991) |
1989 |
2 | | Heeralal Janwa:
Some new upper bounds on the covering radius of binary linear codes.
IEEE Transactions on Information Theory 35(1): 110-122 (1989) |
1985 |
1 | | Heeralal Janwa,
H. F. Mattson Jr.:
Covering Radii of Even Subcodes of t-dense Codes.
AAECC 1985: 120-130 |