Search the dblp DataBase

Publications of Author

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