James L. Massey

According to our database1, James L. Massey authored at least 76 papers between 1963 and 2010.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
New Extensions and Applications of Welch-Bound-Equality Sequence Sets - (Invited Paper).
Proceedings of the Sequences and Their Applications - SETA 2010, 2010

2008
Review of Series on Arabic Origins of Cryptology.
Cryptologia, 2008

2007
Book review.
IEEE Trans. Inf. Theory, 2007

Regenerative pseudo-noise-like (PNL) ranging sequences for deep-space missions.
Int. J. Satell. Commun. Netw., 2007

Regenerative pseudo-noise (PN) ranging sequences for deep-space missions.
Int. J. Satell. Commun. Netw., 2007

2006
Whither Cryptography?
Proceedings of the Progress in Cryptology, 2006

2005
Conservation of mutual and directed information.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2002
Randomness, arrays, differences and duality.
IEEE Trans. Inf. Theory, 2002

2001
Fast Multiplication of Integers for Public-Key Applications.
Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001

The Ubiquity of Reed-Muller Codes.
Proceedings of the Applied Algebra, 2001

1997
Partitioning Cryptanalysis.
Proceedings of the Fast Software Encryption, 4th International Workshop, 1997

1996
Linear Complexity of Periodic Sequences: A General Theory.
Proceedings of the Advances in Cryptology, 1996

1995
An Infinite Class of Counterexamples to a Conjecture Concerning Nonlinear Resilient Functions.
J. Cryptol., 1995

A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-Up Lemma.
Proceedings of the Advances in Cryptology, 1995

1994
Optimum sequence multisets for synchronous code-division multiple-access channels.
IEEE Trans. Inf. Theory, 1994

User-separating demodulation for code-division multiple-access systems.
IEEE J. Sel. Areas Commun., 1994

Some applications of source coding in cryptography.
Eur. Trans. Telecommun., 1994

The condition for a cyclic code to have a complementary dual.
Discret. Math., 1994

SAFER K-64: One Year Later.
Proceedings of the Fast Software Encryption: Second International Workshop. Leuven, 1994

A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences.
Proceedings of the Advances in Cryptology, 1994

1993
Proper complex random processes with applications to information theory.
IEEE Trans. Inf. Theory, 1993

Cascade Ciphers: The Importance of Being First.
J. Cryptol., 1993

SAFER K-64: A Byte-Oriented Block-Ciphering Algorithm.
Proceedings of the Fast Software Encryption, 1993

1992
Constructions of binary constant-weight cyclic codes and cyclically permutable codes.
IEEE Trans. Inf. Theory, 1992

Linear codes with complementary duals.
Discret. Math., 1992

Hash Function Based on Block Ciphers.
Proceedings of the Advances in Cryptology, 1992

Threshold Schemes with Disenrollment.
Proceedings of the Advances in Cryptology, 1992

The Probability Distribution of the Diffie-Hellman Key.
Proceedings of the Advances in Cryptology, 1992

1991
on repeated-root cyclic codes.
IEEE Trans. Inf. Theory, 1991

Local Randomness in Pseudorandom Sequences.
J. Cryptol., 1991

Markov Ciphers and Differential Cryptanalysis.
Proceedings of the Advances in Cryptology, 1991

1990
A Proposal for a New Block Encryption Standard.
Proceedings of the Advances in Cryptology, 1990

1989
An Information-Theoretic Treatment of Homophonic Substitution.
Proceedings of the Advances in Cryptology, 1989

Perfect Local Randomness in Pseudo-Random Sequences.
Proceedings of the Advances in Cryptology, 1989

1988
A spectral characterization of correlation-immune combining functions.
IEEE Trans. Inf. Theory, 1988

Capacity of the discrete-time Gaussian channel with intersymbol interference.
IEEE Trans. Inf. Theory, 1988

An introduction to contemporary cryptology.
Proc. IEEE, 1988

1987
Some families of zero- error block codes for the two-user binary adder channel with feedback.
IEEE Trans. Inf. Theory, 1987

Some New Approaches to Random-Access Communication.
Proceedings of the Performance '87, 1987

Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers.
Proceedings of the Advances in Cryptology, 1987

In Memoriam Tore Herlestam (1929 - 1986).
Proceedings of the Advances in Cryptology, 1987

1986
Theory and practice of error control codes.
Proc. IEEE, 1986

The Characterization of All Binary Sequences with Perfect Linear Complexity Profiles.
EUROCRYPT, 1986

Linear Complexity in Coding Theory.
Proceedings of the Coding Theory and Applications, 2nd International Colloquium, 1986

1985
The collision channel without feedback.
IEEE Trans. Inf. Theory, 1985

Review of 'Theory and Practice of Error Control Codes' (Blahut, R.E.; 1983).
IEEE Trans. Inf. Theory, 1985

Guest editorial (special issue introduction).
IEEE Trans. Inf. Theory, 1985

1984
Information theory: The copernican system of communications.
IEEE Commun. Mag., 1984

Information Theory, The Copernician System of Communications.
Proceedings of the IEEE International Conference on Communications: Links for the Future, 1984

Linear Ciphers and Random Sequence Generators with Multiple Clocks.
Proceedings of the Advances in Cryptology: Proceedings of EUROCRYPT 84, 1984

1983
Capacity of interconnected ring communication systems with unique loop-free routing.
IEEE Trans. Inf. Theory, 1983

1982
Fast Authentication in a Trapdoor - Knapsack Public Key Cryptosystem.
Proceedings of the Cryptography, Proceedings of the Workshop on Cryptography, Burg Feuerstein, Germany, March 29, 1982

1981
Capacity, Cutoff Rate, and Coding for a Direct-Detection Optical Channel.
IEEE Trans. Commun., 1981

1980
Determining the burst-correcting limit of cyclic codes.
IEEE Trans. Inf. Theory, 1980

1976
Our reviewers.
IEEE Trans. Inf. Theory, 1976

1975
Editorial.
IEEE Trans. Inf. Theory, 1975

1974
On the fractional weight of distinct binary n -tuples (Corresp.).
IEEE Trans. Inf. Theory, 1974

1973
Polynomial weights and code constructions.
IEEE Trans. Inf. Theory, 1973

Review of 'Error-Correcting Codes, 2nd edn.' (Peterson, W. W., and Weldon, E. J., Jr.; 1972).
IEEE Trans. Inf. Theory, 1973

1972
Variable-length codes and the Fano metric.
IEEE Trans. Inf. Theory, 1972

Optimum Frame Synchronization.
IEEE Trans. Commun., 1972

Certain infinite Markov chains and sequential decoding.
Discret. Math., 1972

1971
Review of 'An Introduction to Error-Correcting Codes' (Lin, S.; 1970).
IEEE Trans. Inf. Theory, 1971

Arthur Kohlenberg 1924-1970 (Obituary).
IEEE Trans. Inf. Theory, 1971

1969
Shift-register synthesis and BCH decoding.
IEEE Trans. Inf. Theory, 1969

1968
Inverses of Linear Sequential Circuits.
IEEE Trans. Computers, 1968

1967
Inverse Problems in Coding, Automata, and Continuous Systems
Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

1966
Review of 'Information Theory' (Ash, Robert; 1965).
IEEE Trans. Inf. Theory, 1966

Uniform codes.
IEEE Trans. Inf. Theory, 1966

Note on Finite-Memory Sequential Machines.
IEEE Trans. Electron. Comput., 1966

1965
Step-by-step decoding of the Bose-Chaudhuri- Hocquenghem codes.
IEEE Trans. Inf. Theory, 1965

Implementation of burst-correcting convolutional codes.
IEEE Trans. Inf. Theory, 1965

1964
Reversible Codes
Inf. Control., September, 1964

Equivalence of nonlinear shift-registers.
IEEE Trans. Inf. Theory, 1964

Application of Lyapunov's direct method to the error-propagation effect in convolutional codes (Corresp.).
IEEE Trans. Inf. Theory, 1964

1963
Coding theory.
IEEE Trans. Inf. Theory, 1963


  Loading...