Остановите войну!
for scientists:
default search action
Ian F. Blake
- > Home > Persons > Ian F. Blake
Publications
- 2020
- [j84]Seyed Ali Saberali, Lutz Lampe, Ian F. Blake:
Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands. IEEE Trans. Inf. Theory 66(1): 633-648 (2020) - 2019
- [j83]Seyed Ali Saberali, Lutz Lampe, Ian F. Blake:
Decentralized Coded Caching Without File Splitting. IEEE Trans. Wirel. Commun. 18(2): 1289-1303 (2019) - 2018
- [i9]Seyed Ali Saberali, Lutz Lampe, Ian F. Blake:
Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands. CoRR abs/1804.00807 (2018) - 2017
- [i8]Seyed Ali Saberali, Hamidreza Ebrahimzadeh Saffar, Lutz Lampe, Ian F. Blake:
Adaptive Delivery in Caching Networks. CoRR abs/1707.09662 (2017) - [i7]Seyed Ali Saberali, Lutz Lampe, Ian F. Blake:
Decentralized Coded Caching Without File Splitting. CoRR abs/1708.07493 (2017) - 2016
- [j80]Seyed Ali Saberali, Hamidreza Ebrahimzadeh Saffar, Lutz Lampe, Ian F. Blake:
Adaptive Delivery in Caching Networks. IEEE Commun. Lett. 20(7): 1405-1408 (2016) - 2015
- [j78]Ian F. Blake, Alfred Menezes, Douglas R. Stinson:
Guest Editorial: Special Issue in Honor of Scott A. Vanstone. Des. Codes Cryptogr. 77(2-3): 287-299 (2015) - 2014
- [j77]Ian F. Blake, Florian Luca, Igor E. Shparlinski:
VSH and multiplicative modular relations between small primes with polynomial exponents. Appl. Algebra Eng. Commun. Comput. 25(3): 181-188 (2014) - [j76]Ehsan Vahedi, Rabab K. Ward, Ian F. Blake:
Performance Analysis of RFID Protocols: CDMA Versus the Standard EPC Gen-2. IEEE Trans Autom. Sci. Eng. 11(4): 1250-1261 (2014) - 2012
- [j75]Majid Khabbazian, Ian F. Blake, Vijay K. Bhargava:
Local Broadcast Algorithms in Wireless Ad Hoc Networks: Reducing the Number of Transmissions. IEEE Trans. Mob. Comput. 11(3): 402-413 (2012) - [c23]Ehsan Vahedi, Rabab K. Ward, Ian F. Blake:
Analytical modeling of RFID Generation-2 protocol using absorbing Markov chain theorem. GLOBECOM 2012: 385-390 - 2011
- [j74]Ehsan Vahedi, Vincent W. S. Wong, Ian F. Blake, Rabab K. Ward:
Probabilistic Analysis and Correction of Chen's Tag Estimate Method. IEEE Trans Autom. Sci. Eng. 8(3): 659-663 (2011) - [j73]Ehsan Vahedi, Vahid Shah-Mansouri, Vincent W. S. Wong, Ian F. Blake, Rabab K. Ward:
Probabilistic Analysis of Blocking Attack in RFID Systems. IEEE Trans. Inf. Forensics Secur. 6(3-1): 803-817 (2011) - [j72]Amir Nasri, Robert Schober, Ian F. Blake:
Performance and Optimization of Amplify-and-Forward Cooperative Diversity Systems in Generic Noise and Interference. IEEE Trans. Wirel. Commun. 10(4): 1132-1143 (2011) - [c22]Ehsan Vahedi, Rabab K. Ward, Ian F. Blake:
Security Analysis and Complexity Comparison of Some Recent Lightweight RFID Protocols. CISIS 2011: 92-99 - 2010
- [j70]Ian F. Blake, Theodoulos Garefalakis:
A transform property of Kloosterman sums. Discret. Appl. Math. 158(10): 1064-1072 (2010) - [c21]Ehsan Vahedi, Vahid Shah-Mansouri, Vincent W. S. Wong, Ian F. Blake:
A Probabilistic Approach for Detecting Blocking Attack in RFID Systems. ICC 2010: 1-6 - 2008
- [j67]Ian F. Blake, Theodoulos Garefalakis:
Polynomial approximation of bilinear Diffie-Hellman maps. Finite Fields Their Appl. 14(2): 379-389 (2008) - 2007
- [j66]Ian F. Blake, Igor E. Shparlinski:
Statistical distribution and collisions of VSH. J. Math. Cryptol. 1(4): 329-349 (2007) - 2006
- [j65]Ian F. Blake, Theodoulos Garefalakis, Igor E. Shparlinski:
On the bit security of the Diffie-Hellman key. Appl. Algebra Eng. Commun. Comput. 16(6): 397-404 (2006) - [j62]Mehrdad Shamsi, Masoud Ardakani, Ian F. Blake:
Mixed-Q linear space-time codes. IEEE Trans. Commun. 54(5): 849-857 (2006) - 2005
- [c14]Mehrdad Shamsi, Masoud Ardakani, Ian F. Blake:
A new modulation scheme for space-time codes. ICC 2005: 553-557 - 2004
- [j59]Ian F. Blake, Theodoulos Garefalakis:
On the complexity of the discrete logarithm and Diffie-Hellman problems. J. Complex. 20(2-3): 148-170 (2004) - [c11]Mehrdad Shamsi, Ian F. Blake:
Space-time codes with triangular core. ICC 2004: 463-467 - [c10]Mehrdad Shamsi, Ian F. Blake:
Space-time codes from property-L. ISIT 2004: 49 - 2002
- [j58]Ian F. Blake, Theodoulos Garefalakis:
On the Security of the Digital Signature Algorithm. Des. Codes Cryptogr. 26(1-3): 87-96 (2002) - [j57]Huapeng Wu, M. Anwarul Hasan, Ian F. Blake, Shuhong Gao:
Finite Field Multiplier Using Redundant Representation. IEEE Trans. Computers 51(11): 1306-1316 (2002) - 1999
- [c5]Huapeng Wu, M. Anwarul Hasan, Ian F. Blake:
Highly Regular Architectures for Finite Field Computation Using Redundant Basis. CHES 1999: 269-279 - 1998
- [j55]Huapeng Wu, M. Anwarul Hasan, Ian F. Blake:
New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases. IEEE Trans. Computers 47(11): 1223-1234 (1998) - 1997
- [j50]Muzhong Wang, Ian F. Blake:
Normal basis of the finite field F2(p-1)pm over F2. IEEE Trans. Inf. Theory 43(2): 737-739 (1997) - 1996
- [j49]Ian F. Blake, Vahid Tarokh:
On the Trellis Complexity of the Densest Lattice Packings in Rn. SIAM J. Discret. Math. 9(4): 597-601 (1996) - [j47]Vahid Tarokh, Ian F. Blake:
Trellis complexity versus the coding gain of lattices I. IEEE Trans. Inf. Theory 42(6): 1796-1807 (1996) - [j46]Vahid Tarokh, Ian F. Blake:
Trellis complexity versus the coding gain of lattices II. IEEE Trans. Inf. Theory 42(6): 1808-1816 (1996) - 1994
- [j42]Ian F. Blake, Shuhong Gao, Ronald C. Mullin:
Normal and Self-dual Normal Bases from Factorization of c xq+1 + d xq - ax - b. SIAM J. Discret. Math. 7(3): 499-512 (1994) - 1993
- [j39]Ian F. Blake, Shuhong Gao, Ronald C. Mullin:
Explicit Factorization of x2k + 1 over Fp with Prime p= 3 mod 4. Appl. Algebra Eng. Commun. Comput. 4: 89-94 (1993) - [c2]Ian F. Blake, Shuhong Gao, Robert J. Lambert:
Constructive problems for irreducible polynominals over finite fields. Information Theory and Applications 1993: 1-23 - 1990
- [j35]Muzhong Wang, Ian F. Blake:
Bit Serial Multiplication in Finite Fields. SIAM J. Discret. Math. 3(1): 140-148 (1990) - 1989
- [j33]David W. Ash, Ian F. Blake, Scott A. Vanstone:
Low complexity normal bases. Discret. Appl. Math. 25(3): 191-210 (1989) - [j32]Gordon L. Stüber, Jon W. Mark, Ian F. Blake:
Diversity and coding for FH/MFSK systems with fading and jamming. II. Selective diversity. IEEE Trans. Commun. 37(8): 859-869 (1989) - 1988
- [j30]George H. Freeman, Jon W. Mark, Ian F. Blake:
Trellis source codes designed by conjugate gradient optimization. IEEE Trans. Commun. 36(1): 1-12 (1988) - [j29]Gordon L. Stüber, Jon W. Mark, Ian F. Blake:
An adaptive rate algorithm for FH/BFSK signaling. IEEE Trans. Commun. 36(12): 1269-1276 (1988) - [j28]George H. Freeman, Ian F. Blake, Jon W. Mark:
Trellis source code design as an optimization problem. IEEE Trans. Inf. Theory 34(5): 1226-1241 (1988) - 1987
- [j27]Gordon L. Stüber, Ian F. Blake, Jon W. Mark:
Performance of Adaptive Transmission for FH/MFSK Signaling Over Jammed Fading Channels. IEEE J. Sel. Areas Commun. 5(2): 176-187 (1987) - [j26]Gordon L. Stüber, Jon W. Mark, Ian F. Blake:
Diversity and Coding for FH/MFSK Systems with Fading and Jamming-Part I: Multichannel Diversity. IEEE Trans. Commun. 35(12): 1329-1341 (1987) - 1984
- [j24]Gordon L. Stüber, Jon W. Mark, Ian F. Blake:
Sequence acquisition using bit estimation techniques. Inf. Sci. 32(3): 217-229 (1984) - [c1]Ian F. Blake, Ronald C. Mullin, Scott A. Vanstone:
Computing Logarithms in GF(2n). CRYPTO 1984: 73-82 - 1982
- [j20]Ian F. Blake, Jon W. Mark:
A note on complex sequences with low correlations. IEEE Trans. Inf. Theory 28(5): 814-816 (1982) - 1975
- [b1]Ian F. Blake, Ronald C. Mullin:
The mathematical theory of coding. Acad. Press 1975, ISBN 0121035506, pp. I-XI, 1-356
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-01 22:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint