Ian F. Blake

According to our database1, Ian F. Blake authored at least 117 papers between 1968 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Awards

IEEE Fellow

IEEE Fellow 1991, "For contributions to the theory of error-correcting codes.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands.
IEEE Trans. Inf. Theory, 2020

2019
Decentralized Coded Caching Without File Splitting.
IEEE Trans. Wirel. Commun., 2019

2018
On Short Cycle Enumeration in Biregular Bipartite Graphs.
IEEE Trans. Inf. Theory, 2018

2016
New Classes of Partial Geometries and Their Associated LDPC Codes.
IEEE Trans. Inf. Theory, 2016

Adaptive Delivery in Caching Networks.
IEEE Commun. Lett., 2016

A note on diagonal and Hermitian hypersurfaces.
Adv. Math. Commun., 2016

2015
Guest Editorial: Special Issue in Honor of Scott A. Vanstone.
Des. Codes Cryptogr., 2015

Higher dimensional varieties in coding theory.
Proceedings of the 14th IEEE Canadian Workshop on Information Theory, 2015

2014
Performance Analysis of RFID Protocols: CDMA Versus the Standard EPC Gen-2.
IEEE Trans Autom. Sci. Eng., 2014

A note on diagonal and Hermitian surfaces.
CoRR, 2014

VSH and multiplicative modular relations between small primes with polynomial exponents.
Appl. Algebra Eng. Commun. Comput., 2014

Error floors and finite geometries.
Proceedings of the 8th International Symposium on Turbo Codes and Iterative Information Processing, 2014

2013
Raptor codes.
Proceedings of the Handbook of Finite Fields., 2013

LDPC and Gallager codes over finite fields.
Proceedings of the Handbook of Finite Fields., 2013

Basic coding properties and bounds.
Proceedings of the Handbook of Finite Fields., 2013

2012
Local Broadcast Algorithms in Wireless Ad Hoc Networks: Reducing the Number of Transmissions.
IEEE Trans. Mob. Comput., 2012

Analytical modeling of RFID Generation-2 protocol using absorbing Markov chain theorem.
Proceedings of the 2012 IEEE Global Communications Conference, 2012

2011
Performance and Optimization of Amplify-and-Forward Cooperative Diversity Systems in Generic Noise and Interference.
IEEE Trans. Wirel. Commun., 2011

Probabilistic Analysis of Blocking Attack in RFID Systems.
IEEE Trans. Inf. Forensics Secur., 2011

Probabilistic Analysis and Correction of Chen's Tag Estimate Method.
IEEE Trans Autom. Sci. Eng., 2011

Security Analysis and Complexity Comparison of Some Recent Lightweight RFID Protocols.
Proceedings of the Computational Intelligence in Security for Information Systems, 2011

2010
Quasi-Cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares.
IEEE Trans. Commun., 2010

A transform property of Kloosterman sums.
Discret. Appl. Math., 2010

Random Matrices and Codes for the Erasure Channel.
Algorithmica, 2010

Abelian varieties in coding and cryptography.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Quasi-cyclic LDPC codes on Latin squares and the ranks of their parity-check matrices.
Proceedings of the Information Theory and Applications Workshop, 2010

A Probabilistic Approach for Detecting Blocking Attack in RFID Systems.
Proceedings of IEEE International Conference on Communications, 2010

2009
One-round secure comparison of integers.
J. Math. Cryptol., 2009

2008
Polynomial approximation of bilinear Diffie-Hellman maps.
Finite Fields Their Appl., 2008

2007
Statistical distribution and collisions of VSH.
J. Math. Cryptol., 2007

Multiparty Computation to Generate Secret Permutations.
IACR Cryptol. ePrint Arch., 2007

Reducing Communication Overhead of Key Distribution Schemes for Wireless Sensor Networks.
Proceedings of the 16th International Conference on Computer Communications and Networks, 2007

2006
Mixed-Q linear space-time codes.
IEEE Trans. Commun., 2006

On the mean number of encryptions for tree-based broadcast encryption schemes.
J. Discrete Algorithms, 2006

On the bit security of the Diffie-Hellman key.
Appl. Algebra Eng. Commun. Comput., 2006

Windowed Erasure Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Conditionally Verifiable Signature.
Proceedings of the Progress in Cryptology, 2006

Conditional Encrypted Mapping and Comparing Encrypted Numbers.
Proceedings of the Financial Cryptography and Data Security, 2006

2005
Efficient algorithms for Koblitz curves over fields of characteristic three.
J. Discrete Algorithms, 2005

A note on window <i>tau</i>-NAF algorithm.
Inf. Process. Lett., 2005

Conditionally Verifiable Signatures.
IACR Cryptol. ePrint Arch., 2005

Scalable, Server-Passive, User-Anonymous Timed Release Cryptography.
Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

A new modulation scheme for space-time codes.
Proceedings of IEEE International Conference on Communications, 2005

2004
On the complexity of the discrete logarithm and Diffie-Hellman problems.
J. Complex., 2004

Refinements of Miller's Algorithm for Computing Weil/Tate Pairing.
IACR Cryptol. ePrint Arch., 2004

Scalable, Server-Passive, User-Anonymous Timed Release Public Key Encryption from Bilinear Pairing.
IACR Cryptol. ePrint Arch., 2004

On the zeta functions of two towers of function fields.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Space-time codes from property-L.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Space-time codes with triangular core.
Proceedings of IEEE International Conference on Communications, 2004

Strong Conditional Oblivious Transfer and Computing on Intervals.
Proceedings of the Advances in Cryptology, 2004

2003
On products of graphs for LDPC codes.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

Expander graphs and codes.
Proceedings of the Algebraic Coding Theory and Information Theory, 2003

2002
Finite Field Multiplier Using Redundant Representation.
IEEE Trans. Computers, 2002

On the Security of the Digital Signature Algorithm.
Des. Codes Cryptogr., 2002

1999
On the trellis complexity of root lattices and their duals.
IEEE Trans. Inf. Theory, 1999

An area efficient surviving paths unit for the Viterbi algorithm.
Proceedings of the 1999 IEEE International Conference on Communications: Global Convergence Through Communications, 1999

Highly Regular Architectures for Finite Field Computation Using Redundant Basis.
Proceedings of the Cryptographic Hardware and Embedded Systems, 1999

Curves with Many Points and Their Applications.
Proceedings of the Applied Algebra, 1999

1998
Upper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel.
IEEE Trans. Inf. Theory, 1998

Algebraic-Geometry Codes.
IEEE Trans. Inf. Theory, 1998

Trellis Complexity and Minimal Trellis Diagrams of Lattices.
IEEE Trans. Inf. Theory, 1998

Concatenated coding performance for FSK modulation on time-correlated Rician fading channels.
IEEE Trans. Commun., 1998

New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases.
IEEE Trans. Computers, 1998

1997
Normal basis of the finite field F<sub>2</sub>(p-1)p<sup>m</sup> over F<sub>2</sub>.
IEEE Trans. Inf. Theory, 1997

Non-Interleaved Reed-Solomon Coding Performance on Finite State Channels.
Proceedings of the 1997 IEEE International Conference on Communications: Towards the Knowledge Millennium, 1997

1996
Trellis complexity versus the coding gain of lattices II.
IEEE Trans. Inf. Theory, 1996

Trellis complexity versus the coding gain of lattices I.
IEEE Trans. Inf. Theory, 1996

On the performance of fractal compression with clustering.
IEEE Trans. Image Process., 1996

On the Trellis Complexity of the Densest Lattice Packings in R<sup>n</sup>.
SIAM J. Discret. Math., 1996

1995
Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials.
IEEE Trans. Inf. Theory, 1995

1994
Review of 'Source and Channel Coding: An Algorithmic Approach' (Anderson, J.B., and Mohan, S.; 1991).
IEEE Trans. Inf. Theory, 1994

Detection in multivariate non-Gaussian noise.
IEEE Trans. Commun., 1994

Normal and Self-dual Normal Bases from Factorization of c x<sup>q+1</sup> + d x<sup>q</sup> - ax - b.
SIAM J. Discret. Math., 1994

The capacity for a discrete-state code division multiple-access channel.
IEEE J. Sel. Areas Commun., 1994

Two New Decoding Algorithms for Reed-Solomon Codes.
Appl. Algebra Eng. Commun. Comput., 1994

1993
Explicit Factorization of x<sup>2<sup>k</sup></sup> + 1 over F<sub>p</sub> with Prime p= 3 mod 4.
Appl. Algebra Eng. Commun. Comput., 1993

Constructive problems for irreducible polynominals over finite fields.
Proceedings of the Information Theory and Applications, Third Canadian Workshop, Rockland, Ontario, Canada, May 30, 1993

1992
Hermitian Codes as Generalized Reed-Solomon Codes.
Des. Codes Cryptogr., 1992

1991
On the Complete Weight Enumerator of Reed-Solomon Codes.
SIAM J. Discret. Math., 1991

A perspective on coding theory.
Inf. Sci., 1991

1990
An algorithm for the design of generalized quantizers for detection.
IEEE Trans. Commun., 1990

Bit Serial Multiplication in Finite Fields.
SIAM J. Discret. Math., 1990

1989
Performance of multitone FFH/MFSK systems in the presence of jamming.
IEEE Trans. Inf. Theory, 1989

Diversity and coding for FH/MFSK systems with fading and jamming. II. Selective diversity.
IEEE Trans. Commun., 1989

Low complexity normal bases.
Discret. Appl. Math., 1989

1988
Trellis source code design as an optimization problem.
IEEE Trans. Inf. Theory, 1988

An adaptive rate algorithm for FH/BFSK signaling.
IEEE Trans. Commun., 1988

Trellis source codes designed by conjugate gradient optimization.
IEEE Trans. Commun., 1988

1987
Approximations for the probability in the tails of the binomial distribution.
IEEE Trans. Inf. Theory, 1987

Diversity and Coding for FH/MFSK Systems with Fading and Jamming-Part I: Multichannel Diversity.
IEEE Trans. Commun., 1987

Performance of Adaptive Transmission for FH/MFSK Signaling Over Jammed Fading Channels.
IEEE J. Sel. Areas Commun., 1987

1984
Sequence acquisition using bit estimation techniques.
Inf. Sci., 1984

Computing Logarithms in GF(2<sup>n</sup>).
Proceedings of the Advances in Cryptology, 1984

1983
Review of 'Introduction to the Theory of Error-Correcting codes' (Pless, V.; 1982).
IEEE Trans. Inf. Theory, 1983

1982
A note on complex sequences with low correlations.
IEEE Trans. Inf. Theory, 1982

Performance of Nonorthogonal Signaling on an Asynchronous Multiple Access On-Off Channel.
IEEE Trans. Commun., 1982

The Enumeration of Certain Run-Length Sequences
Inf. Control., 1982

1979
Coding with Permutations
Inf. Control., October, 1979

Generalized t-Designs and Weighted Majority Decoding
Inf. Control., May, 1979

1978
Decoding the binary Golay code with miracle octad generators (Corresp.).
IEEE Trans. Inf. Theory, 1978

A note on generalized Room squares.
Discret. Math., 1978

On an inverse for sections of a binomial matrix.
Discret. Math., 1978

1977
Big Buckets Are (Are Not) Better!
J. ACM, 1977

1976
Combinatorial aspects of orthogonal parity checks (Corresp.).
IEEE Trans. Inf. Theory, 1976

1975
Codes over Integer Residue Rings
Inf. Control., December, 1975

On a Generalization of the Pless Symmetry Codes
Inf. Control., April, 1975

Majority logic decoding using combinatorial designs (Corresp.).
IEEE Trans. Inf. Theory, 1975

An infinite class of generalized room squares.
Discret. Math., 1975

The mathematical theory of coding.
Acad. Press, ISBN: 0121035506, 1975

1974
Permutation codes for discrete channels (Corresp.).
IEEE Trans. Inf. Theory, 1974

Configuration matrices of group codes.
IEEE Trans. Inf. Theory, 1974

1973
Level-crossing problems for random processes.
IEEE Trans. Inf. Theory, 1973

Addresses for graphs.
IEEE Trans. Inf. Theory, 1973

1972
Codes Over Certain Rings
Inf. Control., May, 1972

1971
The Leech Lattice as a Code for the Gaussian Channel
Inf. Control., August, 1971

1969
Linear filtering and piecewise linear correlation functions.
IEEE Trans. Inf. Theory, 1969

1968
On a class of processes arising in linear estimation theory.
IEEE Trans. Inf. Theory, 1968


  Loading...