The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ian F. Blake: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ian F. Blake, Alan G. Konheim
    Big Buckets Are (Are Not) Better! [Citation Graph (3, 0)][DBLP]
    J. ACM, 1977, v:24, n:4, pp:591-606 [Journal]
  2. Ian F. Blake
    Curves with Many Points and Their Applications. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:55-64 [Conf]
  3. Ian F. Blake, Vladimir Kolesnikov
    Strong Conditional Oblivious Transfer and Computing on Intervals. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2004, pp:515-529 [Conf]
  4. Huapeng Wu, M. Anwarul Hasan, Ian F. Blake
    Highly Regular Architectures for Finite Field Computation Using Redundant Basis. [Citation Graph (0, 0)][DBLP]
    CHES, 1999, pp:269-279 [Conf]
  5. Ian F. Blake, Ronald C. Mullin, Scott A. Vanstone
    Computing Logarithms in GF(2n). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1984, pp:73-82 [Conf]
  6. Ian F. Blake, Vladimir Kolesnikov
    Conditional Encrypted Mapping and Comparing Encrypted Numbers. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2006, pp:206-220 [Conf]
  7. Cecilio Pimentel, Ian F. Blake
    Non-Interleaved Reed-Solomon Coding Performance on Finite State Channels. [Citation Graph (0, 0)][DBLP]
    ICC (3), 1997, pp:1493-1497 [Conf]
  8. Aldar C.-F. Chan, Ian F. Blake
    Scalable, Server-Passive, User-Anonymous Timed Release Cryptography. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2005, pp:504-513 [Conf]
  9. Ian F. Blake, Aldar C.-F. Chan
    Conditionally Verifiable Signature. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2006, pp:206-220 [Conf]
  10. Ian F. Blake, Shuhong Gao, Robert J. Lambert
    Constructive problems for irreducible polynominals over finite fields. [Citation Graph (0, 0)][DBLP]
    Information Theory and Applications, 1993, pp:1-23 [Conf]
  11. Ian F. Blake, Shuhong Gao, Ronald C. Mullin
    Explicit Factorization of x2k + 1 over Fp with Prime p= 3 mod 4. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1993, v:4, n:, pp:89-94 [Journal]
  12. Ian F. Blake, Theodoulos Garefalakis, Igor Shparlinski
    On the bit security of the Diffie-Hellman key. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2006, v:16, n:6, pp:397-404 [Journal]
  13. Tomik Yaghoobian, Ian F. Blake
    Two New Decoding Algorithms for Reed-Solomon Codes. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1994, v:5, n:, pp:23-43 [Journal]
  14. Ian F. Blake, Theodoulos Garefalakis
    On the Security of the Digital Signature Algorithm. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2002, v:26, n:1-3, pp:87-96 [Journal]
  15. Tomik Yaghoobian, Ian F. Blake
    Hermitian Codes as Generalized Reed-Solomon Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1992, v:2, n:1, pp:5-17 [Journal]
  16. Ian F. Blake
    The Leech Lattice as a Code for the Gaussian Channel [Citation Graph (0, 0)][DBLP]
    Information and Control, 1971, v:19, n:1, pp:66-74 [Journal]
  17. Ian F. Blake
    Codes Over Certain Rings [Citation Graph (0, 0)][DBLP]
    Information and Control, 1972, v:20, n:4, pp:396-404 [Journal]
  18. Ian F. Blake
    On a Generalization of the Pless Symmetry Codes [Citation Graph (0, 0)][DBLP]
    Information and Control, 1975, v:27, n:4, pp:369-373 [Journal]
  19. Ian F. Blake
    Codes over Integer Residue Rings [Citation Graph (0, 0)][DBLP]
    Information and Control, 1975, v:29, n:4, pp:295-300 [Journal]
  20. Ian F. Blake
    The Enumeration of Certain Run-Length Sequences [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:55, n:1-3, pp:222-236 [Journal]
  21. Ian F. Blake, Gérard D. Cohen, Mikhail Deza
    Coding with Permutations [Citation Graph (0, 0)][DBLP]
    Information and Control, 1979, v:43, n:1, pp:1-19 [Journal]
  22. Reihaneh Safavi-Naini, Ian F. Blake
    Generalized t-Designs and Weighted Majority Decoding [Citation Graph (0, 0)][DBLP]
    Information and Control, 1979, v:42, n:3, pp:261-282 [Journal]
  23. Ian F. Blake, V. Kumar Murty, Guangwu Xu
    A note on window tau-NAF algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:5, pp:496-502 [Journal]
  24. Ian F. Blake
    A perspective on coding theory. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1991, v:57, n:, pp:111-118 [Journal]
  25. Gordon L. Stüber, Jon W. Mark, Ian F. Blake
    Sequence acquisition using bit estimation techniques. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1984, v:32, n:3, pp:217-229 [Journal]
  26. Ian F. Blake, V. Kumar Murty, Guangwu Xu
    Refinements of Miller's algorithm for computing the Weil/Tate pairing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:58, n:2, pp:134-149 [Journal]
  27. Ian F. Blake, Theodoulos Garefalakis
    On the complexity of the discrete logarithm and Diffie-Hellman problems. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2004, v:20, n:2-3, pp:148-170 [Journal]
  28. E. C. Park, Ian F. Blake
    On the mean number of encryptions for tree-based broadcast encryption schemes. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:2, pp:215-238 [Journal]
  29. Ian F. Blake, V. Kumar Murty, Guangwu Xu
    Efficient algorithms for Koblitz curves over fields of characteristic three. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:1, pp:113-124 [Journal]
  30. Ian F. Blake, Shuhong Gao, Ronald C. Mullin
    Normal and Self-dual Normal Bases from Factorization of c xq+1 + d xq - ax - b. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:499-512 [Journal]
  31. Ian F. Blake, Khun Kith
    On the Complete Weight Enumerator of Reed-Solomon Codes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:2, pp:164-171 [Journal]
  32. Ian F. Blake, Vahid Tarokh
    On the Trellis Complexity of the Densest Lattice Packings in Rn. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:4, pp:597-601 [Journal]
  33. Muzhong Wang, Ian F. Blake
    Bit Serial Multiplication in Finite Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:1, pp:140-148 [Journal]
  34. Huapeng Wu, M. Anwarul Hasan, Ian F. Blake
    New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1998, v:47, n:11, pp:1223-1234 [Journal]
  35. Huapeng Wu, M. Anwarul Hasan, Ian F. Blake, Shuhong Gao
    Finite Field Multiplier Using Redundant Representation. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2002, v:51, n:11, pp:1306-1316 [Journal]
  36. Mehrdad Shamsi, Masoud Ardakani, Ian F. Blake
    Mixed-Q linear space-time codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2006, v:54, n:5, pp:849-857 [Journal]
  37. Christopher J. Wein, Ian F. Blake
    On the performance of fractal compression with clustering. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Image Processing, 1996, v:5, n:3, pp:522-526 [Journal]
  38. Guillermo E. Atkin, Ian F. Blake
    Performance of multitone FFH/MFSK systems in the presence of jamming. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:2, pp:428-435 [Journal]
  39. Amir H. Banihashemi, Ian F. Blake
    Trellis Complexity and Minimal Trellis Diagrams of Lattices. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:5, pp:1829-1847 [Journal]
  40. Amir H. Banihashemi, Ian F. Blake
    On the trellis complexity of root lattices and their duals. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:2168-2172 [Journal]
  41. Ian F. Blake
    Review of 'Introduction to the Theory of Error-Correcting codes' (Pless, V.; 1982). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:4, pp:63- [Journal]
  42. Ian F. Blake
    Review of 'Source and Channel Coding: An Algorithmic Approach' (Anderson, J.B., and Mohan, S.; 1991). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:1, pp:289-0 [Journal]
  43. Ian F. Blake, H. Darabian
    Approximations for the probability in the tails of the binomial distribution. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:3, pp:426-0 [Journal]
  44. Ian F. Blake, Chris Heegard, Tom Høholdt, V. Wei
    Algebraic-Geometry Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:6, pp:2596-2618 [Journal]
  45. Ian F. Blake, Jon W. Mark
    A note on complex sequences with low correlations. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1982, v:28, n:5, pp:814-0 [Journal]
  46. Shraga I. Bross, Ian F. Blake
    Upper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:334-340 [Journal]
  47. D. Dabiri, Ian F. Blake
    Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:4, pp:873-885 [Journal]
  48. George H. Freeman, Ian F. Blake, Jon W. Mark
    Trellis source code design as an optimization problem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1226-1241 [Journal]
  49. Vahid Tarokh, Ian F. Blake
    Trellis complexity versus the coding gain of lattices I. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1796-1807 [Journal]
  50. Vahid Tarokh, Ian F. Blake
    Trellis complexity versus the coding gain of lattices II. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1808-1816 [Journal]
  51. Muzhong Wang, Ian F. Blake
    Normal basis of the finite field F2(p-1)pm over F2. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:2, pp:737-739 [Journal]

  52. Reducing Communication Overhead of Key Distribution Schemes for Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  53. Random Matrices and Codes for the Erasure Channel. [Citation Graph (, )][DBLP]


  54. Low complexity normal bases. [Citation Graph (, )][DBLP]


  55. A transform property of Kloosterman sums. [Citation Graph (, )][DBLP]


Search in 0.079secs, Finished in 0.083secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002