J. L. Massey.
*Threshold Decoding*.

Cambridge, MA: M.I.T. Press, 1963. Awarded 1963 Paper Award by the IEEE Group on Information Theory.

J. L. Massey.

Information, machines and men.

In F. J. Crosson and K. M. Sayre, editors, *Philosophy and Cybernetics*, pages 37-69. Notre Dame Press, Notre Dame, IN, 1967.

J. L. Massey.

Advances in threshold decoding.

In A. Ralarishnan, editor, *Advances in Communication Systems, Vol. III*, pages 91-115. New York: Academic Press, 1968.

J. L. Massey.

Applications of automata theory in coding.

In J. Tou, editor, *Applied Automata Theory*, pages 125-146. New York: Academic Press, 1968.

J. L. Massey.

Error correcting codes.

In A. R. Meetham, editor, *Encyclopaedia of Linguistics, Information and Control*, pages 173-176. London: Pergamon, 1969.

J. L. Massey and O. N. Garcia.

Error-correcting codes in computer arithmetic.

In J. Tou, editor, *Advances in Information Systems Science, Vol.4*, pages 273-326. New York: Plenum Press, 1972.

J. L. Massey.

Coding theory.

In W. Lederman and S. Vajda, editors, *Handbook of Applicable Mathematics, Vol.5, Combinatorics and Geometry*, pages 623-676. Chichester and New York: Wiley, 1985.

J. L. Massey.

Contemporary cryptology: An introduction.

In G. J. Simmons, editor, *Contemporary Cryptology-The Science of Information Integrity*, pages 1-39. New York: IEEE Press, 1992.

J. L. Massey.

Some algebraic and distance properties of convolutional codes.

In H. B. Mann, editor, *Error Correcting Codes*, pages 89-109. New York: Wiley, 1968.

J. L. Massey.

Methods of alleviation of ionospheric scintillation effects on digital communications.

In W. G. Schmidt and G. E. LaVean, editors, *Communication Satellite Developments: Technology, Progress in Astronautics and Aeronautics,Vol. 42*, pages 279-287. Cambridge, MA: M.I.T. Press, 1976.

J. L. Massey.

The codeword and syndrome methods for data compression with error-correcting codes.

In J. K. Skwirzynski, editor, *New Directions in Signal Processing in Communication and Control, NATO Advanced Study Institutes Series E12*, pages 3-13, Leyden, The Netherlands, 1975. Noordhoff.

J. L. Massey.

Markov information sources.

In J. K. Skwirzynski, editor, *New Directions in Signal Processing in Communication and Control, NATO Advanced Study Institutes Series E25*, pages 15-26, Leyden, The Netherlands, 1975. Noordhoff.

J. L. Massey.

Error bounds for tree codes, trellis codes and convolutional codes with encoding and decoding procedures.

In G. Longo with Preface by J. L. Massey, editor, *Coding and Complexity, CISM Courses and Lectures No. 216*, pages 1-57. Wien and New York: Springer-Verlag, 1976.

J. L. Massey.

Joint source and channel coding.

In J. K. Skwirzynski, editor, *Communication Systems and Random Process Theory, NATO Advanced Studies Institutes Series E25*, pages 279-293, The Netherlands, 1978. Noordhoff.

J. L. Massey.

Collision-resolution algorithms and random-access communications.

In G. Longo, editor, *Multi-User Communication Systems, CISM Courses and Lectures No. 265*, pages 73-137. Wien and New York: Springer, 1981.

P. Schoebi and J. L. Massey.

Fast authentication in a trapdoor-knapsack public key cryptosystem.

In T. Beth, editor, *Cryptography, Lecture Notes in Computer Science, No. 149*, pages 289-294. New York: Springer, 1983.

J. L. Massey.

An information-theoretic approach to algorithms.

In J. K. Skwirynski, editor, *The Impact of Processing Techniques in Communications, NATO Advanced Study Institutes Series E91*, pages 3-20, Dordrecht, The Netherlands, 1985. Nijhoff.

J. L. Massey and R. A. Rueppel.

Linear ciphers and random sequence generators with multiple clocks.

In *Advances in Cryptology-EUROCRYPT '84 (Eds T. Beth, N. Cot and I. Ingemarsson), Lecture Notes in Computer Science, No. 209. Heidelberg and New York: Springer*, pages 74-87, 1985.

J. L. Massey.

Cryptography - a selective survey.

In *Digital Communications (Eds. E. Biglieri and G. Prati). Amersterdam: North-Holand*, pages 3-21, 1986. Reprinted as Invited Paper in Alta Frequenza, Vol. 55, No.1, pp. 4-11, Jan. - Feb. 1986.

U. M. Maurer J. L. Massey and M.-Z. Wang.

Non-expanding, key-minimal, robustly-perfect, linear and bilinear ciphers.

In *Advances in Cryptology - EUROCRYPT '87 (Eds. D. Chaum and W. L. Price), Lecture Notes in Computer Science, No. 304. Heidelberg and New York: Springer*, pages 237-247, 1988.

J. L. Massey.

Channel models for random-access systems.

In J.K. Skwirzynski, editor, *Performance Limits in Communication Theory and Practice, NATO Advances Studies Institutes Series E142*, pages 391-402, Dordrecht, The Netherlands, 1988. Kluwer Academic.

J. L. Massey.

Some new approaches to random-access communications.

In P.-J. Courtois and G. Latouche, editors, *Performance'87, Proc. 12th IFIP WG 7.3 Int. Symp. in Computer Performance Modelling*, pages 551-569, Amsterdam and New York, 1988. North Holland. Reprinted in Multiple Access Communications: Foundations for Emerging Technologies (Ed. N. Abramson). New York: IEEE Press, 1993, pp. 354-378.

J. L. Massey and T. Schaub.

Linear complexity in coding theory.

In G. Cohen and Ph. Godlewski, editors, *Coding Theory and Applications, Lecture Notes in Computer Science, No. 311*, pages 19-32, Heidelberg and New York, 1988. Springer.

Y. J. B. Kuhn H. N. Jendal and J. L. Massey.

An information-theoretic approach to homophonic substitution.

In J.-J. Quisquater and J. Vandewalle, editors, *Advances in Cryptology-EUROCRYPT '89, Lecture Notes in Computer Science, No. 434*, pages 382-394, Heidelberg and New York, 1990. Springer.

J. L. Massey.

Correction to ``an information-theoretic approach to homophonic substitution''.

July 16 1996.

U. M. Maurer and J. L. Massey.

Perfect local randomness in pseudo-random sequences.

In G. Brassard, editor, *Advances in Cryptology-CRYPTO'89, Lecture Notes in Computer Science, No. 435*, pages 100-112, Heidelberg and New York, 1990. Springer.

J. L. Massey.

The relevance of information theory to modern cryptography.

In E. Arikan, editor, *Communications, Control and Signal Processing, Proc. of 1990 Bilkent Int. Conference*, pages 176-182, Amsterdam, 1990. Elsevier.

X. Lai and J. L. Massey.

A proposal for a new block encryption standard.

In I.B. Damgard, editor, *Advances in Cryptology-EUROCRYPT '90, Lecture Notes in Computer Science No. 473*, pages 389-404, Heidelberg and New York, 1991. Springer.

J. L. Massey X. Lai and S. Murphy.

Markov ciphers and differential cryptanalysis.

In D. W. Davies, editor, *Advances in Cryptology-EUROCRYPT '91, Lecture Notes in Computer Science No. 547*, pages 17-38, Heidelberg and New York, 1991. Springer. A preliminary version with the same title by X. Lai and J. L. Massey appears in AGEN Communications, Nr. 53, pp. 25-29, June 1991.

J. L. Massey.

Deep-space communications and coding: A marriage made in heaven.

In J. Hagenauer, editor, *Advanced Methods for Satellite and Deep Space Communications, Lecture Notes in Control and Information Sciences No. 182*, pages 1-17, Heidelberg and New York, 1992. Springer.

X. Lai and J. L. Massey.

Hash functions based on block ciphers.

In R. A. Rueppel, editor, *Advances in Cryptology-EUROCRYPT '92, Lecture Notes in Computer Science, No. 658*, pages 55-70, Heidelberg and New York, 1993. Springer.

J. L. Massey and T. Mittelholzer.

Welch's bound and sequence sets for code-divison multiple-access systems.

In R. Capocelli, A. De Santis, and U. Vaccaro, editors, *Sequences II: Methods in Communication, Security and Computer Sciences*, pages 63-78, Heidelberg and New York, 1993. Springer.

C. P. Waldvogel and J. L. Massey.

The probability distribution of the diffie-hellman key.

In J. Seberry and Y. Zheng, editors, *Advances in Cryptology-Auscrypt '92, Lecture Notes in Computer Science No. 718*, pages 492-504, Heidelberg and New York, 1993. Springer.

V. C. da Rocha and J. L. Massey.

A new approach to the design of codes for the binary adder channel.

In M. J. Ganley, editor, *Cryptography and Coding III, IMA Conf. Series, New Series No. 45*, pages 179-185, Oxford, 1993. Clarendon Press.

A. H. Chan B. Blakley, G. R. Blakley and J. L. Massey.

Threshold schemes with disenrollment.

In E. F. Brickell, editor, *Advances in Cryptology-CRYPTO '92, Lecture Notes in Computer Science No. 740*, pages 540-548, New York, 1993. Springer.

J. L. Massey.

SAFER K-64: A byte-oriented block-ciphering algorithm.

In R. Anderson, editor, *Fast Software Encryption, Lecture Notes in Computer Science No. 809*, pages 1-17, New York, 1994. Springer.

J. L. Massey and S. Serconek.

A fourier transform approach to the linear complexity of nonlinearly filtered sequences.

In Y. G. Desmedt, editor, *Advances in Cryptology-CRYPTO '94, Lecture Notes in Computer Science No. 839*, pages 332-340, New York, 1994. Springer.

R. A. Rueppel and J. L. Massey.

Leaf-average node-sum interchanges in rooted trees with applications.

In R. E. Blahut, Jr. D. J. Costello, U. Maurer, and T. Mittelholzer, editors, *Communications and Cryptography: Two Sides of One Tapestry*, pages 343-355, Dordrecht and Boston, 1994. Kluwer.

J. L. Massey.

Some applications of coding theory in cryptography.

In P. G. Farrell, editor, *Codes and Cyphers: Cryptography and Coding IV*, pages 33-47, Essex, England, 1995. Formara Ltd.

J. L. Massey.

Towards an information theory of spread-spectrum systems.

In S. G. Glisic and P. A. Leppänen, editors, *Code Division Multiple Access Communications*, pages 29-46, Boston, Dordrecht and London, 1995. Kluwer.

G. C. Kramer C. Harpes and J. L. Massey.

A generalization of linear cryptanalysis and the applicability of matsui's piling-up lemma.

In L. C. Guillou and J.-J. Quisquater, editors, *Advances in Cryptology-EUROCRYPT '95, Lecture Notes in Computer Science, No. 921*, pages 24-38, Heidelberg and New York, 1995. Springer.

J. L. Massey.

SAFER K-64: One year later.

In B. Preneel, editor, *Fast Software Encryption, Lecture Notes in Computer Science, No. 1008*, pages 212-241, Heidelberg and New York, 1995. Springer.

J. L. Massey and S. Serconek.

Linear complexity of periodic sequences: A general theory.

In *Advances in Cryptology-CRYPTO'96 (Ed. N. Koblitz), Lecture Notes in Computer Science No. 1109. New York: Springer*, pages 358-371, 1996.

C. Harpes and J. L. Massey.

Partitioning cryptanalysis.

In *Fast Software Encryption (Ed. E. Biham), Lecture Notes in Computer Science, No. 1267. Heidelberg and New York: Springer*, pages 13-27, 1997.

J. L. Massey.

Orthogonal, antiorthogonal and self-orthogonal matrices and their codes.

In *Communications and Coding (Ed. M. Darnell and B. Honary). Taunton, England & New York: Research Studies Press & Wiley*, pages 3-9, 1998.

W. W. Peterson and J. L. Massey.

Coding theory.

*IEEE Trans. on Info. Theory, Vol. IT-9*, pages 223-229, Oct. 1963.

J. L. Massey and R. Liu.

Application of lyapunov's direct method to the error-propagation problem in convolutional codes.

*IEEE Trans. on Info. Theory, Vol. IT-10*, pages 248-250, July 1964.

J. L. Massey.

Reversible codes.

*Information & Control, Vol. 7*, pages 369-380, Sept. 1964.

J. L. Massey and R. Liu.

Equivalence of nonlinear-feedback shift-registers.

*IEEE Trans. on Info. Theory, Vol. IT-10*, pages 378-379, Oct. 1964.

J. L. Massey.

Survey of residue coding for arithmetic errors.

*ICC Bulletin, Vol. 3*, pages 195-209, Oct. 1964.

J. L. Massey.

Implementation of burst-correcting convolutional codes.

*IEEE Trans. on Info. Theory, Vol. IT-11*, pages 416-422, July 1965.

J. L. Massey.

Step-by-step decoding of the bose-chaudhuri-hocquenghen codes.

*IEEE Trans. on Info. Th., Vol. IT-11*, pages 580-585, Oct. 1965.

J. L. Massey.

Uniform codes.

*IEEE Trans. on Info. Th., Vol. IT-12*, pages 132-134, April 1966.

J. L. Massey.

Note on finite-memory sequential machines.

*IEEE Trans. on Elec. Comp., Vol. EC-15*, pages 658-659, Aug. 1966.

J. L. Massey and L. V. Auth.

Impedance magnitude measurements from a resistive bridge.

*IEEE Trans. on Education, Vol. E-10*, pages 50-51, March 1967.

J. L. Massey.

Shift-register synthesis and bch decoding.

*IEEE Trans. on Info. Th., Vol. IT-15*, pages 122-127, Jan. 1969. Reprinted in Algebraic CodingTheory: History and Development (Ed. I. F. Blake), Benchmark Papers in Electrical Engineering and Computer Science. Stroudsburg, PA: Dowden, Hutchison and Ross, 1973, pp. 233-238.

J. L. Massey and M. K. Sain.

Codes, automata and continuous systems: Explicit interconnections.

*IEEE Trans. on Auto. Cont.rol, Vol.AC-12*, pages 644-50, December 1967. Also appears in Proc. NEC, Vol. 23, pp. 33-38, 1967.

J. L. Massey and M. K. Sain.

Inverses of linear sequential circuits.

*IEEE Trans. on Computers, Vol. C-17*, pages 330-337, April 1968. See also J. L. Massey and M. K. Sain "Postscript to Inverses of Linear Sequential Circuits" IEEE Trans. on Computers, Vol. C-17, pp. 1177, Dec. 1968. Reprinted in Key Papers in the Development of Coding Theory (Ed. E. R. Berlekamp). New York: IEEE Press, 1974, pp. 205-212.

M. K. Sain and J. L. Massey.

Invertibility of linear, time-invariant dynamical systems.

*IEEE Trans. on Auto. Cont.,Vol. AC-14*, pages 141-149, April 1969.

J. L. Massey.

Variable-length codes and the fano metric.

*IEEE Trans. on Info. Th., Vol. IT-18*, pages 196-198, Jan. 1972.

J. L. Massey and Jr D. J. Costello.

Nonsystematic convolutional codes for sequential decoding in space applications.

*IEEE Trans. Com. Tech., Vol. Com-19*, pages 806-813, Oct. 1971.

J. L. Massey.

Optimum frame synchronization.

*IEEE Trans. on Comm., Vol. COM-20*, pages 115-119, April 1972.

M. K. Sain J. L. Massey and J. M. Geist.

Certain infinite markov chains and sequential decoding.

*Discrete Math., Vol. 3*, pages 163-175, Sept. 1972.

J. L. Massey, Jr. D. J. Costello, and J. Justesen.

Polynomial weights and code constructions.

*IEEE Trans. Info. Th., Vol. IT-19*, pages 101-110, Jan. 1973.

J. L. Massey.

On the fractional weight of distinct binary n-tuples.

*IEEE Trans Info.Th., Vol. IT-20*, page 131, Jan. 1974.

H. J. Matt and J. L. Massey.

Determining the burst-correcting limit of cyclic codes.

*IEEE Trans. Info. Th., Vol. IT-26*, pages 289-297, May 1980.

J. L. Massey.

Capacity, cut-off rate and coding for a direct-detection optical channel.

*IEEE Trans. Comm., Vol Com-29*, pages 1615-1612, Nov. 1981.

J. L. Massey.

What is a bit of information?

*Scientia Electrica, Vol. 28, No. 1*, pages 1-11, 1982. Reprinted in German Translation as "Was ist ein Bit Information?" Frequenz, Band 37, s. 110-115, Mai 1983.

M. Schlatter and J. L. Massey.

Capacity of interconnected ring communication systems with unique loop-free routing.

*IEEE Trans. on Info. Th., Vol. IT-29*, pages 774-778, Sept. 1983.

J. L. Massey and P. Mathys.

The collision channel without feedback.

*IEEE Trans. Info. Th., Vol. IT-31*, pages 192-204, March 1985. Awarded the IEEE 1986 W. R. G. Baker Award for the "most outstanding paper reporting original work in the Transactions, Journals and Magazines of IEEE Societies or in the Proceedings of the IEEE".

J. L. Massey.

Standardisierung kryptographischer dienst.

*Bulletin der Schweizerischen Elektrotechnischen Vereins, Vol. 77, No. 7*, pages 367-372, 12, April 1986.

T. Berger Z. Zhang and J. L. Massey.

Some families of zero-error block codes for the 2-user binary adder channel with feedback.

*IEEE Trans Info. Th., Vol. IT-33*, pages 613-619, Sept. 1987.

J. L. Massey.

Probabilistic encipherment.

*E. & M. (Elektrotechnik & Machinenbau, Austria), Vol. 104, No. 12*, pages 561-562, Dec. 1987.

J. L. Massey.

An introduction to contemporary cryptology.

*Proc. IEEE, Vol 76*, pages 533-549, May 1988.

W. Hirt and J. L. Massey.

Capacity of the discrete-time gaussian channel with intersymbol interference.

*IEEE Trans. Info. Th., Vol. IT-34*, pages 380-388, May 1988.

G. Z. Xiao and J. L. Massey.

A spectral chracterization of correlation-immune combining functions.

*IEEE Trans. Info. Th., Vol. IT-34*, pages 569-571, May 1988.

U. M. Maurer and J. L. Massey.

Local randomness in pseudorandom sequences.

*J. of Cryptology, Vol. 4, No. 2*, pages 135-149, 1991.

P. Schoeller G. Castagnoli, J. L. Massey and N. von Seeman.

On repeated-root cyclic codes.

*IEEE Trans. Info. Th., Vol. IT-37*, pages 337-342, March 1991.

U. M. Maurer and J. L. Massey.

Cascade ciphers: The importance of being first.

*J. of Cryptology, Vol. 6, No. 1*, pages 55-61, 1993.

N. Q. A, L. Györfi, and J. L. Massey.

Constructions of binary constant-weight cyclic codes and cyclically permutable codes.

*IEEE Trans. Info. Th., Vol. IT-38*, pages 940-949, May 1992.

J. L. Massey.

Linear codes with complementary duals.

*Discrete Math., Vol. 106/107*, pages 337-342, 1992. Also appears in A Collection of Contributions in Honor of Jack van Lint (Eds. P. J. Cameron and H. C. A. van Tilborg), Topics in Discrete Math. 7. Amsterdam: Elsevier 1992, pp. 337-342.

F. D. Neeser and J. L. Massey.

Proper complex random processes with applications to information theory.

*IEEE Trans. Info. Th., Vol. IT-39*, pages 1293-1302, July 1993.

M. Rupf and J. L. Massey.

Optimum sequence multisets for synchronous code-division multiple-access channels.

*IEEE Trans. Info. Th., Vol. IT-40*, pages 1261-1266, July 1994.

X. Yang and J. L. Massey.

The condition for a cyclic code to have a complementary dual.

*Discrete Math. , Vol. 126*, pages 391-393, 1994.

F. Tarköy M. Rupf and J. L. Massey.

User-separating demodulation for code-division multiple-access systems.

*IEEE J. Selected Areas in Comm., Vol. 12*, pages 786-795, June 1994.

J. L. Massey.

Some applications of source coding in cryptography.

*European Trans. on Telecomm., Vol. 5*, pages 421-429, July-August 1994.

D. R. Stinson and J. L. Massey.

An infinite class of counterexamples to a conjecture concerning non-linear resilient functions.

*J. of Cryptology, Vol 8, No. 3*, pages 167-173, 1995.

J. L. Massey.

Causal interpretations of random variables.

*(in Russian), Problemy Peredachi Informatsii, Vol. 32, No. 1*, pages 131-136, January-March, 1996.

J. L. Massey.

Correction to ``causal interpretations of random variables''.

Problemy Peredachi Informatsii, May 16 1997.

J. L. Massey.

Error-correcting codes applied to computer technology.

In *Proc. Nat. Elec. Conf., Vol. 19*, pages 142-147, Oct. 1963. Awarded the Best Tutorial Paper Award at the 1963 National Electronics Conference.

J. L. Massey and R. Liu.

Monotone feedback shift-registers.

In *Proc. of 2nd Annual Allerton Conference on Circuit & System Theory*, pages 864-874, 1964.

J. L. Massey and R. Liu.

A new diagram for feedback shift-registers.

In *Proc. of 3rd Annual Allerton Conf. on Circuit & Systems Theory*, pages 73-81, 1965.

J. L. Massey and M. K. Sain.

Inverse problems in coding, automata and continuous systems.

In *IEEE Conf. Record of 8th Symposium on Switching and Automata Theory*, pages 226-232, Oct. 1967.

J. L. Massey.

Catastrophic error-propagation in convolutional codes.

In *Proc. 11th Midwest Circuit Th. Symp*, pages 583-587, 1968.

J. L. Massey and M. K. Sain.

Trunk and tree searching properties of the fano sequential decoding algorithm.

In *Proc. of 6th Annual Allerton Conf. on Circuit and System Theory*, pages 153-160, 1968.

J. L. Massey and M. K. Sain.

A modified inverse for linear dynamical systems.

In *Proc. IEEE 8th Adaptive Processes Symp*, pages 5a1-5a3, 1969.

J. L. Massey and M. K. Sain.

Derivative controllability.

In *Proc. 4th Princeton Conf. on Info. Sci. and Systems*, page 189, 1970.

J. L. Massey.

Can coding beat the system?

In *IEEE Int. Convention Digest*, pages 354-355, 1970.

Jr. J. J. Uhran and J. L. Massey.

Analysis of satellite communications in a multipath environment.

In *ICC '70 Conf. Record*, pages 10-20 to 10-24, 1970.

J. L. Massey.

Coding and modulation in digital communications.

In *Proc. Int. Zurich Seminar on Digital Comm*, pages E2(1)-E2(4), 1974.

J. L. Massey and Jr J. J. Uhran.

Sub-baud coding.

In *Proc. 13th Annual Allerton Conf. on Circuit and System Theory*, pages 539-547, 1975.

J. L. Massey.

The statistical significance of error probability as determined from decoding simulations for long codes.

In *Proc. 7th Annual Pittsburgh Conf. on Modeling and Simulation*, pages 63-64, April 26-27, 1976.

J. L. Massey.

The use of redundant packets in slotted aloha type random access schemes.

In *Proc. 1978 Conf. on Info. Sciences and Systems*, pages 78-81, March 29-31, 1978.

J. L. Massey.

Foundations and methods of channel encoding.

In *Proc. Int. Conf. on Info. and System Theory in Digital Comm., NTG-Fachberichte, Band 65*, pages 148-157, 1978.

J. L. Massey.

Coding techniques for digital data networks.

In *Proc. Int. Conf. on Info. and System Theory in Digital Comm., NTG-Fachberichte, Band 65*, pages 307-315, 1978.

J. L. Massey.

A generalized formulation of minimum shift keying modulation.

In *ICC '80 Conf. Record, Vol. 2*, pages 26.5.1-26.5.4, 1980.

J. L. Massey.

Logarithms in finite cyclic groups-cryptographic issues.

In *Proc. 4th Benelux Symp. on Info. Theory*, pages 17-25, 1983.

J. L. Massey.

A simplified treatment of wyner's wire-tap channel.

In *Proc. 21st Allerton Conf. on Comm., Control and Computing*, pages 268-276, 1983.

A. Fischer J. L. Massey, A. Gubser, B. Huber P. Hochstrasser, and R. Sutter.

A self-synchronizing digital scrambler for cryptographic protection of data.

In *Proc. Int. Zurich Seminar on Digital Comm*, pages 163-169, 1984.

J. L. Massey.

The how and why of channel coding.

In *Proc. Int. Zurich Seminar on Digital Comm*, pages 67-73, 1984.

J. L. Massey.

Information theory, the copernician system of communications.

In *Proc. ICC '84, Vol. 1*, pages 159-162, 1984. Reprinted in IEEE Communication Magazine, Vol. 22, pp. 26-28, Dec. 1984.

J. L. Massey.

Delayed-decimation/square sequences.

In *Proc. 2nd Joint Swedish-Soviet Int. Workshop on Info. Th*, pages 118-123, 1985.

T. Berger Z. Zhang and J. L. Massey.

Some families of zero-error codes for the 2-user binary adder channel.

In *Proc. 23rd Allerton Conf. on Comm., Control and Computing*, 1985.

A. S. Glass and J. L. Massey.

Plastic cards-how smart is secure?

In *Landis & Gyr Review, Vol 32, No. 2*, page 1986, pp. 22-38. Reprinted in German version "Plastikkarten-wie intelligent is sicher?" in Schweizerische Technische Zeitshrift, No. 9, pp. 10-20, No. 10, pp. 36-46 and No. 11, pp. 21-29, May-June, 1986.

J. L. Massey.

Cryptography and system theory.

In *Proc. 24th Allerton Conf. on Comm., Control and Computing*, pages 1-8, 1986.

J. L. Massey.

On the entropy of integer-valued random variables.

In *Proc. 1988 Beijing Int. Workshop on Info. Th*, pages C1.1-C1.4, July 1988.

X. Lai and J. L. Massey.

Some connections between scramblers and invertible automata.

In *Proc. 1988 Beijing Int. Workshop on Info. Th*, pages DI5.1-DI5.5, 1988.

J. L. Massey.

A short introduction to coding theory and practice.

In *Proc. Int. Symp. on Signals, Systems and Electronics*, pages 629-633, 1989.

J. L. Massey and T. Mittelholzer.

Convolutional codes over rings.

In *Proc. 4th Joint Swedish-Soviet Int. workshop on Info. Th*, pages 14-18, 1989.

J. L. Massey and T. Mittelholzer.

Systematicity and rotational invariance of convolutional codes over rings.

In *Proc. 2nd Int. Workshop on Algebraic and Combinatorial Coding Theory, Leningrad*, pages 154-158, 1990.

J. L. Massey.

Causality, feedback and directed information.

In *Proc. 1990 Int. Symp. on Info. Th. & its Applications, Hawaii, USA*, pages 303-305, Nov. 27-30, 1990.

R. A. Rueppel and J. L. Massey.

The security of natel d gsm.

In *Technische Mitteilungen PTT, No. 3*, page 1992, pp. 108-112. presented at the Berner Technologie Forum on Mobile Communications, Berne Oct. 24, 1991, Republished in German as "Die Sicherheit Natel D GSM" Technische Mitteilungen PTT, No. 4 pp. 150-153, 1992.

J. L. Massey.

Coding and modulation for code-division multiple accessing.

In *Proc. Third Int.Workshop on Digital Signal Processing Techniques Applied to Space Communications, ESTEC, Noordwijk*, pages 3.1-3.17, 1992.

J. L. Massey.

Some applications of source coding in cryptography.

In *Proc. 3rd Symp. on State and Progress of Research in Cryptography, Rome*, pages 143-160, 1993.

J. L. Massey.

Minimal codewords and secret sharing.

In *Proc. 6th Joint Swedish-Russian Int. Workshop on Info. Theory*, pages 276-279, 1993.

G. C. Kramer C. Harpes and J. L. Massey.

Generalized linear cryptanalysis and applicability of the piling-up lemma.

In *Proc. 15th Benelux Symp. on Info. Th*, pages 90-99, 1994.

J. L. Massey.

Information theory aspects of spread-spectrum communications.

In *Proc. IEEE 3rd Int. Symp. on Spread Spectrum Techniques and Applications, Oulu, Finland*, pages 16-21, 1994.

J. L. Massey.

Coding for multiple access communications.

In *Proc.ITG- Fachtagung Codierung für Quelle, Kanal und Übertragung, Nr. 130, Munich, Germany*, pages 11-20, 26-28 October, 1994.

J. L. Massey.

Is collision resolution practical?

In *Proc. IEEE Info. Th. Workshop on Info. Th., Multiple Access and Queueing, St. Louis, MO, 19-21*, page 3, April 1995.

J. L. Massey.

Spectrum spreading and multiple accessing.

In *Proc. IEEE Info. Th. Workshop on Info.Theory, Rydzyna, Poland, 25-29*, page 3.1ff, June 1995.

J. L. Massey.

A group generalization of linear cryptanalysis.

In *Proc. 3rd Int. Symp. on Comm. Theory and Appl., Ambleside, England, 10-14*, pages 275-276, July 1995.

X. Lin T. Mittelholzer and J. L. Massey.

Multilevel turbo coding for m-ary quadrature and amplitude modulation.

In *Proc. Intl. Syp. on Turbo Codes and Related Topics, Brest, France, 3-5*, pages 127-134, Sept. 1997.

J. L. Massey.

The discrete fourier transform in coding and cryptography.

In *Proc. IEEE Information Theory Workshop, San Diego, CA, 8-11*, pages 1-2, Feb. 1998.

J. L. Massey.

Uniform codes.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 19, 1966.

J. L. Massey and M. K. Sain.

Distribution of the minimum cumulative metric for sequential decoding.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 56, 1969.

J. L. Massey and Jr J. J. Uhran.

Sub-baud coding and cyclic codes.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, pages 25-26, 1970.

Jr. D. J. Costello and J. L. Massey.

Constructing good convolutional codes from cyclic block codes.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 44, 1972.

J. L. Massey.

An error bound for random tree codes.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, pages D3.1-D3.2, 1973.

J. L. Massey.

An information-theoretic approach to data-processing algorithms.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, pages 35-36, 1974.

J. L. Massey.

All signal sets centered about the origin are optimal at low energy-to-noise ratios on the awgn channel.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, pages 80-81, 1976.

J. L. Massey.

A class of maximum distance separable codes over gf(p) encodable using only addition and subtraction.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 133, 1976.

J. L. Massey.

Shannon's 'proof' of the noisy coding theorem.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 107, 1977.

J. L. Massey.

Convolutional codes - theory lagging practice.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 20, 1979.

J. L. Massey.

Capacity, cut-off rate and coding for a direct-detection optical channel.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 58, 1981.

J. L. Massey.

Effect of channel error on the capetanakis and related random-access algorithms.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 65, 1981.

M. Schlatter and J. L. Massey.

Capacity of interconnected ring communication systems with unique loop-free routing.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, pages 61-62, 1982.

J. L. Massey.

The capacity of the collision channel without feedback.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 101, 1982.

J. L. Massey.

The entropy of a rooted tree with probabilities.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 127, 1983.

N. Q. A, L. Györfi, and J. L. Massey.

Some constructions of protocol sequences for collision channels and a class of optimum cyclic constant weight codes.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 40, 1985.

R. A. Rueppel and J. L. Massey.

The knapsack as a nonlinear function.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 46, 1985.

I. Ingemarsson and J. L. Massey.

Synchronization of truly random binary sequences.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 57, 1985.

Jr. D. J. Costello and J. L. Massey.

A lower bound on the minimum distance growth rate of fixed convoutional codes.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 90, 1985.

W. Hirt and J. L. Massey.

On the mutual information and cut-off rate of channels with intersymbol interference.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, pages 114-115, 1985.

J. L. Massey and I. Ingamarsson.

The Rip van Winkle cipher - a simple and provably computionally secure cipher with a finite key.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 146, 1985.

N. von Seeman J. L. Massey and P. Schoeller.

Hasse derivatives and repeated-root cyclic codes.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 39, 1986.

T. Schaub and J. L. Massey.

Bounds on the minimum distance of cyclic codes via bounds on the linear complexity of periodic sequences with known patterns of zeros.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 71, 1986.

A. Gubser and J. L. Massey.

Node synchronization of r = 1/2 binary convolutional codes.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 127, 1986.

N. Q. A, L. Györfi, and J. L. Massey.

Families of sequences with optimal generalized hamming correlation properties.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, pages 136-137, 1986.

J. L. Massey.

Towards a proof of the simplex conjecture?

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 59, 1988. Presented as the Shannon Lecture at this symposium.

J. Ruprecht and J. L. Massey.

Binary input sequences for maximum-likelihood estimation of multipath channels.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 32, 1990.

U. M. Maurer and J. L. Massey.

Cascade ciphers: The importance of being first.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 118, 1990.

T. Riedel J. L. Massey, T. Mittelholzer and M. Vollenweider.

Ring convolutional codes for phase modulation.

In *Abstracts of Papers, IEEE Int. Symp. on Info. Th*, page 176, 1990.

J. L. Massey.

On welch's bound for the correlation of a sequence set.

In *Proc. IEEE Int. Symp. on Info. Th*, page 385, 1991.

A. H. Chan B. Blakley, G. R. Blakley and J. L. Massey.

Threshold schemes with disenrollment.

In *Proc. IEEE Int. Symp. on Info. Th*, page 229, 1993.

M. Rupf and J. L. Massey.

Optimum sequence multisets for symbol-synchronous code-division multiple-access channels.

In *Proc. IEEE Int. Symp. on Info. Th*, page 373, 1993.

J. L. Massey.

Guessing and entropy.

In *Proc. IEEE Int. Symp. on Info. Th*, page 204, 1994.

J. L. Massey.

Determining the independence of random variables.

In *Proc. IEEE Int. Symp. on Info. Th*, page 11, 1995.

Jr. V. C. da Rocha and J. L. Massey.

On the entropy bound for optimum homophonic substitution.

In *Proc. IEEE Int. Symp. on Info. Th*, page 93, 1997.

J. L. Massey.

Review of: Information theory by r. ash. new york: Wiley, 1965.

IEEE Trans. Info. Th., Vol. IT-12, Oct. 1966 pp. 488-489.

J. L. Massey.

Review of: An introduction to error-correcting codes by s. lin. englewood cliffs, n. j.: Prentice-hall, 1970.

IEEE Trans. Info. Th., Vol. IT-17, Nov. 1971 pp. 768-769.

J. L. Massey.

Review of: Topics in mathematical system theory by r. e. kalman, p. l. falb and m. a. arbib, part iii, automata theory. new york: Mcgraw-hill, 1969.

IEEE Trans. Auto. Cont., Vol. AC-17, Feb. 1972 p. 182.

J. L. Massey.

Review of: Error-correcting codes, 2nd edition, by w. w. peterson and e. j. weldon, jr., cambridge, mass. and london, m.i.t. press, 1972.

IEEE Trans. Info. Th., vol IT-19, May 1973 pp. 373-374.

J. L. Massey.

Review of: The theory of error-correcting codes by f. j. macwilliams and n. j. a. sloane. amsterdam: North-holland and new york: Elsevier/north holland, 1977.

IEEE Trans. Info. Th.,Vol. IT-15, July, 1979 pp. 501-502.

J. L. Massey.

Review of: Theory and practice of error control codes by r. e. blahut. reading, ma: Addison-wesley, 1983.

IEEE Trans. Info. Th. , Vol. IT-31, July 1985 pp. 553-554. Reprinted in Proc. IEEE, Vol. 74, pp. 1293-1294, 1986.

J. L. Massey.

Error detection and correction system for convolutional codes.

U. S. Patent No. 3,303,333, Feb. 7 1967.

J. L. Massey.

Error detection and correction in signal transmission by use of convolutional codes.

U. S. Patent No. 3,402,393, Sept. 17 1968.

J. L. Massey.

Processing signal information.

U. S. Patent No. 3,439,334, April 15 1969.

J. L. Massey.

Error correcting means for digital transmission systems.

U. S. Patent No. 3,500,320, March 10 1970.

J. L. Massey.

Error correction in coded messages.

U. S. Patent No. 3,566,352, Feb. 23 1971.

J. L. Massey and T. Schaub.

Method and apparatus for recognizing in a receiver the start of a telegram signal consisting of a bit impulse sequence.

U. S. Patent No. 4,506,372, March 19 1985.

J. L. Massey and J. K. Omura.

Method and apparatus for maintaining the privacy of digital messages conveyed by public means.

U. S. Patent No. 4,567,600, Jan. 28 1986.

J. K. Omura and J. L. Massey.

Computational method and apparatus for finite field arithmetic.

U. S. Patent No. 4,587,627, May 6 1986.

J. L. Massey and R. A. Rueppel.

Method of, and apparatus for, transforming a digital data sequence into an encoded from.

U. S. Patent No. 4,797,922, Jan. 10 1989.

J. L. Massey.

Multiple access method.

U. S. Patent No. 5,170,412, Dec. 8 1992.

J. L. Massey.

Arhur Kohlenberg.

IEEE Transactions on Information Theory, March 1971. Vol. IT-17, No. 2.

J. L. Massey.

Editorial.

IEEE Transactions on Information Theory, May 1975. p. 249.

J. L. Massey.

Our reviewers.

IEEE Transactions on Information Theory, Novembar 1976. p. 442.

J. L. Massey.

Our reviewers.

IEEE Transactions on Information Theory, November 1977. Vol. IT-23, No. 6.

J. L. Massey.

Guest editorial.

IEEE Transactions on Information Theory, March 1985. Vol. IT-31, No. 2.

J. L. Massey.

Matrices of varied orthogonality and their codes.

Submitted for short presentation at ISIT'98, 1998.

J. L. Massey.

Research in information theory - is the end in sight?

Summary of presentation for the Univertity of Notre Dame Sesquicentennial Symposium.

J. L. Massey.

Marcel J.E. Golay (1902-1989.

IEEE Information Society Newsletter, June 1990.

J. L. Massey.

Will electrical engineering education survive another century?

Text of address for the Symposium for the Centennial of Electrical Engineering at the University of Notre Dame, March 1996.

J. L. Massey.

The difficutly with difficutlty.

A Guide to the Transparencies from the EUROCRYPT'96 IACR Distinguished Lecture, July, 17 1996.

T. Mittelholzer J. L. Massey.

Technical assistance for the cdma communication system analysis.

Final Report, ESTEC Contract No. 8696/89/NL/US Work Order No. 1, February, 18 1991.

J. L. Massey.

Analysis of two-key triple des encryption.

Technical report, Cylink Corporation of Sunnyvale, California, April 2 1994.

J. L. Massey.

From bits to bytes to batches.

ICCS/ISPACS'96 Keynote Address, November 27 1996.

M. Z. Wang and J. L. Massey.

The characterization of all binary sequences with perfect linear complexity profiles.

Submitted to IEEE Transactions on Information Theory, July 30 1986.

J. L. Massey.

Comparison of phase modulation systems.

Technical report, Jet Propulsion Laboratory, Pasadena, California, February 15 1979. Reprinted from The Deep Space Network Progress Report 42-49, November and December 1978.

J. L. Massey and Ruey wen Liu.

Improved diagrame for feedback shift-registers.

Dept. of Elec. Engr., University of Notre Dame, Notre Dame, Ind.