Ian F. Blake

IEEE Trans. Inf. Theory, 2020

2019

Decentralized Coded Caching Without File Splitting.

[BibT_eX]

[DOI]

Seyed Ali Saberali

Lutz Lampe

IEEE Trans. Wirel. Commun., 2019

2018

On Short Cycle Enumeration in Biregular Bipartite Graphs.

[BibT_eX]

[DOI]

Hamidreza Ebrahimzadeh Saffar

IEEE Trans. Inf. Theory, 2018

2016

New Classes of Partial Geometries and Their Associated LDPC Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Adaptive Delivery in Caching Networks.

[BibT_eX]

[DOI]

Seyed Ali Saberali

Lutz Lampe

IEEE Commun. Lett., 2016

A note on diagonal and Hermitian hypersurfaces.

[BibT_eX]

[DOI]

Hamid Usefi

Adv. Math. Commun., 2016

2015

Guest Editorial: Special Issue in Honor of Scott A. Vanstone.

[BibT_eX]

[DOI]

Alfred Menezes

Douglas R. Stinson

Des. Codes Cryptogr., 2015

Higher dimensional varieties in coding theory.

[BibT_eX]

[DOI]

Hamid Usefi

Proceedings of the 14th IEEE Canadian Workshop on Information Theory, 2015

2014

Performance Analysis of RFID Protocols: CDMA Versus the Standard EPC Gen-2.

[BibT_eX]

[DOI]

Ehsan Vahedi

Rabab K. Ward

IEEE Trans Autom. Sci. Eng., 2014

A note on diagonal and Hermitian surfaces.

[BibT_eX]

[DOI]

Hamid Usefi

CoRR, 2014

VSH and multiplicative modular relations between small primes with polynomial exponents.

[BibT_eX]

[DOI]

Florian Luca

Igor E. Shparlinski

Appl. Algebra Eng. Commun. Comput., 2014

Error floors and finite geometries.

[BibT_eX]

[DOI]

Qiuju Diao

Proceedings of the 8th International Symposium on Turbo Codes and Iterative Information Processing, 2014

2013

Raptor codes.

[BibT_eX]

W. Cary Huffman

Proceedings of the Handbook of Finite Fields., 2013

LDPC and Gallager codes over finite fields.

[BibT_eX]

W. Cary Huffman

Proceedings of the Handbook of Finite Fields., 2013

Basic coding properties and bounds.

[BibT_eX]

W. Cary Huffman

Proceedings of the Handbook of Finite Fields., 2013

2012

Local Broadcast Algorithms in Wireless Ad Hoc Networks: Reducing the Number of Transmissions.

[BibT_eX]

[DOI]

Majid Khabbazian

Vijay K. Bhargava

IEEE Trans. Mob. Comput., 2012

Analytical modeling of RFID Generation-2 protocol using absorbing Markov chain theorem.

[BibT_eX]

[DOI]

Ehsan Vahedi

Rabab K. Ward

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.

[BibT_eX]

[DOI]

Amir Nasri

Robert Schober

IEEE Trans. Wirel. Commun., 2011

Probabilistic Analysis of Blocking Attack in RFID Systems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2011

Probabilistic Analysis and Correction of Chen's Tag Estimate Method.

[BibT_eX]

[DOI]

IEEE Trans Autom. Sci. Eng., 2011

Security Analysis and Complexity Comparison of Some Recent Lightweight RFID Protocols.

[BibT_eX]

[DOI]

Ehsan Vahedi

Rabab K. Ward

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.

[BibT_eX]

[DOI]

Li Zhang

Qin Huang

Khaled A. S. Abdel-Ghaffar

IEEE Trans. Commun., 2010

A transform property of Kloosterman sums.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Random Matrices and Codes for the Erasure Channel.

[BibT_eX]

[DOI]

Chris Studholme

Algorithmica, 2010

Abelian varieties in coding and cryptography.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Quasi-cyclic LDPC codes on Latin squares and the ranks of their parity-check matrices.

[BibT_eX]

[DOI]

Li Zhang

Qin Huang

Khaled A. S. Abdel-Ghaffar

Proceedings of the Information Theory and Applications Workshop, 2010

A Probabilistic Approach for Detecting Blocking Attack in RFID Systems.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2010

2009

One-round secure comparison of integers.

[BibT_eX]

[DOI]

Vladimir Kolesnikov

J. Math. Cryptol., 2009

2008

Polynomial approximation of bilinear Diffie-Hellman maps.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2008

2007

Statistical distribution and collisions of VSH.

[BibT_eX]

[DOI]

Igor E. Shparlinski

J. Math. Cryptol., 2007

Multiparty Computation to Generate Secret Permutations.

[BibT_eX]

[DOI]

Chris Studholme

IACR Cryptol. ePrint Arch., 2007

Reducing Communication Overhead of Key Distribution Schemes for Wireless Sensor Networks.

[BibT_eX]

[DOI]

E. C. Park

Proceedings of the 16th International Conference on Computer Communications and Networks, 2007

2006

Mixed-Q linear space-time codes.

[BibT_eX]

[DOI]

Masoud Ardakani

IEEE Trans. Commun., 2006

On the mean number of encryptions for tree-based broadcast encryption schemes.

[BibT_eX]

[DOI]

E. C. Park

J. Discrete Algorithms, 2006

Refinements of Miller's algorithm for computing the Weil/Tate pairing.

[BibT_eX]

[DOI]

Guangwu Xu

J. Algorithms, 2006

On the bit security of the Diffie-Hellman key.

[BibT_eX]

[DOI]

Igor E. Shparlinski

Appl. Algebra Eng. Commun. Comput., 2006

Windowed Erasure Codes.

[BibT_eX]

[DOI]

Chris Studholme

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Conditionally Verifiable Signature.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2006

Conditional Encrypted Mapping and Comparing Encrypted Numbers.

[BibT_eX]

[DOI]

Vladimir Kolesnikov

Proceedings of the Financial Cryptography and Data Security, 2006

2005

Efficient algorithms for Koblitz curves over fields of characteristic three.

[BibT_eX]

[DOI]

Guangwu Xu

J. Discrete Algorithms, 2005

A note on window tau-NAF algorithm.

[BibT_eX]

[DOI]

Guangwu Xu

Inf. Process. Lett., 2005

Conditionally Verifiable Signatures.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

Scalable, Server-Passive, User-Anonymous Timed Release Cryptography.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

A new modulation scheme for space-time codes.

[BibT_eX]

[DOI]

Masoud Ardakani

Proceedings of IEEE International Conference on Communications, 2005

2004

On the complexity of the discrete logarithm and Diffie-Hellman problems.

[BibT_eX]

[DOI]

J. Complex., 2004

Scalable, Server-Passive, User-Anonymous Timed Release Public Key Encryption from Bilinear Pairing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

On the zeta functions of two towers of function fields.

[BibT_eX]

[DOI]

Kenneth W. Shum

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Space-time codes from property-L.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Space-time codes with triangular core.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2004

Strong Conditional Oblivious Transfer and Computing on Intervals.

[BibT_eX]

[DOI]

Vladimir Kolesnikov

Proceedings of the Advances in Cryptology, 2004

2003

On products of graphs for LDPC codes.

[BibT_eX]

[DOI]

Jun Xu

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

Expander graphs and codes.

[BibT_eX]

Kenneth W. Shum

Proceedings of the Algebraic Coding Theory and Information Theory, 2003

2002

Finite Field Multiplier Using Redundant Representation.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2002

On the Security of the Digital Signature Algorithm.

[BibT_eX]

Des. Codes Cryptogr., 2002

1999

On the trellis complexity of root lattices and their duals.

[BibT_eX]

[DOI]

Amir H. Banihashemi

IEEE Trans. Inf. Theory, 1999

An area efficient surviving paths unit for the Viterbi algorithm.

[BibT_eX]

[DOI]

Dariush Dabiri

Proceedings of the 1999 IEEE International Conference on Communications: Global Convergence Through Communications, 1999

Highly Regular Architectures for Finite Field Computation Using Redundant Basis.

[BibT_eX]

[DOI]

Huapeng Wu

M. Anwarul Hasan

Proceedings of the Cryptographic Hardware and Embedded Systems, 1999

Curves with Many Points and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1999

1998

Upper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel.

[BibT_eX]

[DOI]

Shraga I. Bross

IEEE Trans. Inf. Theory, 1998

Algebraic-Geometry Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

Trellis Complexity and Minimal Trellis Diagrams of Lattices.

[BibT_eX]

[DOI]

Amir H. Banihashemi

IEEE Trans. Inf. Theory, 1998

Concatenated coding performance for FSK modulation on time-correlated Rician fading channels.

[BibT_eX]

[DOI]

Cecilio Pimentel

IEEE Trans. Commun., 1998

New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases.

[BibT_eX]

[DOI]

Huapeng Wu

M. Anwarul Hasan

IEEE Trans. Computers, 1998

1997

Normal basis of the finite field F2(p-1)pm over F2.

[BibT_eX]

[DOI]

Muzhong Wang

IEEE Trans. Inf. Theory, 1997

Non-Interleaved Reed-Solomon Coding Performance on Finite State Channels.

[BibT_eX]

[DOI]

Cecilio Pimentel

Proceedings of the 1997 IEEE International Conference on Communications: Towards the Knowledge Millennium, 1997

1996

Trellis complexity versus the coding gain of lattices II.

[BibT_eX]

[DOI]

Vahid Tarokh

IEEE Trans. Inf. Theory, 1996

Trellis complexity versus the coding gain of lattices I.

[BibT_eX]

[DOI]

Vahid Tarokh

IEEE Trans. Inf. Theory, 1996

On the performance of fractal compression with clustering.

[BibT_eX]

[DOI]

Christopher J. Wein

IEEE Trans. Image Process., 1996

On the Trellis Complexity of the Densest Lattice Packings in Rn.

[BibT_eX]

[DOI]

Vahid Tarokh

SIAM J. Discret. Math., 1996

1995

Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials.

[BibT_eX]

[DOI]

Dariush Dabiri

IEEE Trans. Inf. Theory, 1995

1994

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

[BibT_eX]

IEEE Trans. Inf. Theory, 1994

Detection in multivariate non-Gaussian noise.

[BibT_eX]

[DOI]

Benny C. Y. Wong

IEEE Trans. Commun., 1994

Normal and Self-dual Normal Bases from Factorization of c xq+1 + d xq - ax - b.

[BibT_eX]

[DOI]

Shuhong Gao

SIAM J. Discret. Math., 1994

The capacity for a discrete-state code division multiple-access channel.

[BibT_eX]

[DOI]

Marcelo S. Alencar

IEEE J. Sel. Areas Commun., 1994

Two New Decoding Algorithms for Reed-Solomon Codes.

[BibT_eX]

[DOI]

Tomik Yaghoobian

Appl. Algebra Eng. Commun. Comput., 1994

1993

Explicit Factorization of x2k + 1 over Fp with Prime p= 3 mod 4.

[BibT_eX]

[DOI]

Shuhong Gao

Appl. Algebra Eng. Commun. Comput., 1993

Constructive problems for irreducible polynominals over finite fields.

[BibT_eX]

[DOI]

Shuhong Gao

Robert J. Lambert

Proceedings of the Information Theory and Applications, Third Canadian Workshop, Rockland, Ontario, Canada, May 30, 1993

1992

Hermitian Codes as Generalized Reed-Solomon Codes.

[BibT_eX]

[DOI]

Tomik Yaghoobian

Des. Codes Cryptogr., 1992

1991

On the Complete Weight Enumerator of Reed-Solomon Codes.

[BibT_eX]

[DOI]

Khun Kith

SIAM J. Discret. Math., 1991

A perspective on coding theory.

[BibT_eX]

[DOI]

Inf. Sci., 1991

1990

An algorithm for the design of generalized quantizers for detection.

[BibT_eX]

[DOI]

Benny C. Y. Wong

IEEE Trans. Commun., 1990

Bit Serial Multiplication in Finite Fields.

[BibT_eX]

[DOI]

Muzhong Wang

SIAM J. Discret. Math., 1990

1989

Performance of multitone FFH/MFSK systems in the presence of jamming.

[BibT_eX]

[DOI]

Guillermo E. Atkin

IEEE Trans. Inf. Theory, 1989

Diversity and coding for FH/MFSK systems with fading and jamming. II. Selective diversity.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1989

Low complexity normal bases.

[BibT_eX]

[DOI]

David W. Ash

Scott A. Vanstone

Discret. Appl. Math., 1989

1988

Trellis source code design as an optimization problem.

[BibT_eX]

[DOI]

George H. Freeman

IEEE Trans. Inf. Theory, 1988

An adaptive rate algorithm for FH/BFSK signaling.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1988

Trellis source codes designed by conjugate gradient optimization.

[BibT_eX]

[DOI]

George H. Freeman

IEEE Trans. Commun., 1988

1987

Approximations for the probability in the tails of the binomial distribution.

[BibT_eX]

[DOI]

H. Darabian

IEEE Trans. Inf. Theory, 1987

Diversity and Coding for FH/MFSK Systems with Fading and Jamming-Part I: Multichannel Diversity.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1987

Performance of Adaptive Transmission for FH/MFSK Signaling Over Jammed Fading Channels.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 1987

1984

Sequence acquisition using bit estimation techniques.

[BibT_eX]

[DOI]

Inf. Sci., 1984

Computing Logarithms in GF(2n).

[BibT_eX]

[DOI]

Scott A. Vanstone

Proceedings of the Advances in Cryptology, 1984

1983

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

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1983

1982

A note on complex sequences with low correlations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1982

Performance of Nonorthogonal Signaling on an Asynchronous Multiple Access On-Off Channel.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1982

The Enumeration of Certain Run-Length Sequences

[BibT_eX]

[DOI]

Inf. Control., 1982

1979

Coding with Permutations

[BibT_eX]

[DOI]

Gérard D. Cohen

Mikhail Deza

Inf. Control., October, 1979

Generalized t-Designs and Weighted Majority Decoding

[BibT_eX]

[DOI]

Reihaneh Safavi-Naini

Inf. Control., May, 1979

1978

Decoding the binary Golay code with miracle octad generators (Corresp.).

[BibT_eX]

[DOI]

Ian B. Gibson

IEEE Trans. Inf. Theory, 1978

A note on generalized Room squares.

[BibT_eX]

[DOI]

J. J. Stiffler

Discret. Math., 1978

On an inverse for sections of a binomial matrix.

[BibT_eX]

[DOI]

Avraham A. Melkman

Discret. Math., 1978

1977

Big Buckets Are (Are Not) Better!

[BibT_eX]

[DOI]

Alan G. Konheim

J. ACM, 1977

1976

Combinatorial aspects of orthogonal parity checks (Corresp.).

[BibT_eX]

[DOI]

Mushfiqur Rahman

IEEE Trans. Inf. Theory, 1976

1975

Codes over Integer Residue Rings

[BibT_eX]

[DOI]

Inf. Control., December, 1975

On a Generalization of the Pless Symmetry Codes

[BibT_eX]

[DOI]

Inf. Control., April, 1975

Majority logic decoding using combinatorial designs (Corresp.).

[BibT_eX]

[DOI]

Mushfiqur Rahman

IEEE Trans. Inf. Theory, 1975

An infinite class of generalized room squares.

[BibT_eX]

[DOI]

J. J. Stiffler

Discret. Math., 1975

The mathematical theory of coding.

[BibT_eX]

[DOI]

Acad. Press, ISBN: 0121035506, 1975

1974

Permutation codes for discrete channels (Corresp.).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1974

Configuration matrices of group codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1974

1973

Level-crossing problems for random processes.

[BibT_eX]

[DOI]

William C. Lindsey

IEEE Trans. Inf. Theory, 1973

Addresses for graphs.

[BibT_eX]

[DOI]

James H. Gilchrist

IEEE Trans. Inf. Theory, 1973

1972

Codes Over Certain Rings

[BibT_eX]

[DOI]

Inf. Control., May, 1972

1971

The Leech Lattice as a Code for the Gaussian Channel

[BibT_eX]

[DOI]

Inf. Control., August, 1971

1969

Linear filtering and piecewise linear correlation functions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1969

1968

On a class of processes arising in linear estimation theory.

[BibT_eX]

[DOI]