James Massey
#5,858
Most Influential Person Now
American information theorist and cryptologist
James Massey's AcademicInfluence.com Rankings
James Masseycomputer-science Degrees
Computer Science
#605
World Rank
#625
Historical Rank
#328
USA Rank
Information Theory
#8
World Rank
#9
Historical Rank
#6
USA Rank
James Masseymathematics Degrees
Mathematics
#1875
World Rank
#2981
Historical Rank
#759
USA Rank
Measure Theory
#640
World Rank
#878
Historical Rank
#261
USA Rank
Download Badge
Computer Science Mathematics
Why Is James Massey Influential?
(Suggest an Edit or Addition)According to Wikipedia, James Lee Massey was an American information theorist and cryptographer, Professor Emeritus of Digital Technology at ETH Zurich. His notable work includes the application of the Berlekamp–Massey algorithm to linear codes, the design of the block ciphers IDEA and SAFER, and the Massey-Omura cryptosystem .
James Massey's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Shift-register synthesis and BCH decoding (1969) (2228)
- Proper complex random processes with applications to information theory (1993) (923)
- Theory and practice of error control codes (1986) (810)
- A Proposal for a New Block Encryption Standard (1991) (725)
- Markov Ciphers and Differential Cryptanalysis (1991) (676)
- CAUSALITY, FEEDBACK AND DIRECTED INFORMATION (1990) (657)
- Stabilization of Nonlinear Uncertain Systems (1998) (567)
- Guessing and entropy (1994) (498)
- Invertibility of linear time-invariant dynamical systems (1969) (473)
- A spectral characterization of correlation-immune combining functions (1988) (395)
- Optimum sequence multisets for synchronous code-division multiple-access channels (1994) (377)
- Linear codes with complementary duals (1992) (356)
- The collision channel without feedback (1985) (340)
- Inverses of Linear Sequential Circuits (1968) (337)
- Review of 'Error-Correcting Codes, 2nd edn.' (Peterson, W. W., and Weldon, E. J., Jr.; 1972) (1973) (325)
- Minimal Codewords and Secret Sharing (1999) (317)
- Collision-Resolution Algorithms and Random-Access Communications (1981) (312)
- Direct adaptive control algorithms: theory and applications (1993) (300)
- Capacity of the discrete-time Gaussian channel with intersymbol interference (1988) (261)
- Welch’s Bound and Sequence Sets for Code-Division Multiple-Access Systems (1993) (257)
- An introduction to contemporary cryptology (1988) (249)
- On Repeated-root Cyclic Codes (1991) (229)
- SAFER K-64: A Byte-Oriented Block-Ciphering Algorithm (1993) (221)
- Constructions of binary constant-weight cyclic codes and cyclically permutable codes (1992) (200)
- Polynomial weights and code constructions (1973) (197)
- A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-Up Lemma (1995) (178)
- Hash Function Based on Block Ciphers (1992) (177)
- Communications and Cryptography: Two Sides of One Tapestry (1994) (163)
- The condition for a cyclic code to have a complementary dual (1994) (157)
- Capacity, Cutoff Rate, and Coding for a Direct-Detection Optical Channel (1981) (155)
- Adaptive Control (1998) (143)
- Reversible Codes (1964) (139)
- Variable-length codes and the Fano metric (1972) (132)
- Step-by-step decoding of the Bose-Chaudhuri- Hocquenghem codes (1965) (109)
- Conservation of mutual and directed information (2005) (103)
- Cryptography ― a selective survey (1986) (89)
- Codes, automata, and continuous systems: Explicit interconnections (1967) (87)
- Partitioning Cryptanalysis (1997) (87)
- Threshold Schemes with Disenrollment (1993) (83)
- Nonsystematic convolutional codes for sequential decoding in space applications (1971) (82)
- User-separating demodulation for code-division multiple-access systems (1994) (76)
- Cascade ciphers: The importance of being first (1993) (62)
- Linear Complexity of Periodic Sequences: A General Theory (1996) (55)
- A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences (1994) (54)
- Joint Source and Channel Coding (1977) (53)
- Convolutional codes over rings (1989) (51)
- SAFER K-64: One Year Later (1994) (51)
- Information theory aspects of spread-spectrum communications (1994) (50)
- An Information-Theoretic Treatment of Homophonic Substitution (1990) (45)
- An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions (1995) (42)
- On Welch's Bound For The Correlation Of A Sequence Set (1991) (37)
- Some Applications of Coding Theory in Cryptography (1999) (37)
- Deep-space communications and coding: A marriage made in heaven (1992) (36)
- Application of Lyapunov's direct method to the error-propagation effect in convolutional codes (Corresp.) (1964) (35)
- Error-correcting codes in computer arithmetic. (1972) (35)
- Implementation of burst-correcting convolutional codes (1965) (35)
- Error Bounds for Tree Codes, Trellis Codes, and Convolutional Codes with Encoding and Decoding Procedures (1975) (33)
- Linear Complexity in Coding Theory (1988) (33)
- Towards an Information Theory of Spread-Spectrum Systems (1995) (33)
- The Necessary and Sufficient Condition for a Cyclic Code to Have a Complementary Dual (1999) (32)
- Some applications of source coding in cryptography (2010) (31)
- Linear Ciphers and Random Sequence Generators with Multiple Clocks (1985) (30)
- Review of 'The Theory of Error-Correcting Codes' (MacWilliams, F.J. and Sloane, N.J.A.; 1978) (1979) (28)
- Determining the burst-correcting limit of cyclic codes (1980) (28)
- The Discrete Fourier Transform in Coding and Cryptography (1999) (27)
- Regenerative pseudo‐noise (PN) ranging sequences for deep‐space missions (2007) (25)
- Perfect Local Randomness in Pseudo-Random Sequences (1989) (24)
- Equivalence of nonlinear shift-registers (1964) (24)
- On the Optimality of SAFER + Diffusion (1999) (23)
- The theory of error-correcting codes (1980) (22)
- Neural Network Models: Theory and Projects (2013) (22)
- A generalized formulation of minimum shift keying modulation (1980) (19)
- On the fractional weight of distinct binary n -tuples (Corresp.) (1974) (19)
- SYSTEMATICITY AND ROTATIONAL INVARIANCE OF CONVOLUTIONAL CODES OVER RINGS (1990) (19)
- Some New Approaches to Random-Access Communication (1987) (17)
- The Characterization of All Binary Sequences with Perfect Linear Complexity Profiles (1986) (17)
- Information theory: The copernican system of communications (1984) (15)
- Local randomness in pseudorandom sequences (2004) (14)
- Channel Models for Random-Access Systems (1988) (14)
- The Probability Distribution of the Diffie-Hellman Key (1992) (13)
- Applied Digital Information Theory II (13)
- Note on Finite-Memory Sequential Machines (1966) (13)
- Certain infinite Markov chains and sequential decoding (1972) (13)
- An Innnite Class of Counterexamples to a Conjecture concerning Non-linear Resilient Functions (1995) (12)
- Advances in Threshold Decoding (1968) (11)
- Some families of zero- error block codes for the two-user binary adder channel with feedback (1987) (11)
- On the entropy bound for optimum homophonic substitution (1997) (11)
- An Information-Theoretic Approach to Algorithms (1985) (10)
- Review of 'Theory and Practice of Error Control Codes' (Blahut, R.E.; 1983) (1985) (10)
- Uniform codes (1966) (9)
- Some algebraic and distance properties of convolutional codes. (1968) (8)
- Comparison of rate one-half, equivalent constraint length 24, binary convolutional codes for use with sequential decoding on the deep-space channel (1976) (8)
- Catastrophic error-propagation in convolutional codes. (1968) (8)
- Inverse Problems in Coding, Automata, and Continuous Systems (1967) (8)
- Fast Multiplication of Integers for Public-Key Applications (2001) (8)
- Principles of stability analysis for random accessing with feedback (2007) (7)
- Codes and Ciphers: Fourier and Blahut (1998) (7)
- Coding theory (1963) (7)
- Fast Authentication in a Trapdoor - Knapsack Public Key Cryptosystem (1982) (7)
- Leaf-Average Node-Sum Interchanges in Rooted Trees with Applications (1994) (6)
- Optimum Sequence Multisets for Symbol-Synchronous Code-Division Multiple-Access Channels (1993) (6)
- The Ubiquity of Reed-Muller Codes (2001) (5)
- FAMILIES OF SEQUENCES WITH OPTIMAL GENERALIZED HAMMING CORRELATION PROPERTIES. (1986) (5)
- Trunk and tree searching properties of the Fano sequential decoding algorithm. (1968) (5)
- Orthogonal , Antiorthogonal and Self-Orthogonal Matrices and their Codes (1998) (5)
- Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers (1987) (5)
- A modified inverse for linear dynamical systems (1969) (5)
- On decoding bit error probability for binary convolutional codes (2000) (4)
- Regenerative pseudo‐noise‐like (PNL) ranging sequences for deep‐space missions (2007) (4)
- Capacity of interconnected ring communication systems with unique loop-free routing (1983) (4)
- Markov information sources (1975) (3)
- Better than "optimum" homophonic substitution (2000) (3)
- Coding for Multiple Access Communications (1994) (3)
- Systematic bits are better and no buts about it (2002) (3)
- Whither Cryptography? (2006) (2)
- Security against Generalized Linear Cryptanalysis and Partitioning Cryptanalysis (1995) (2)
- Claude Elwood Shannon (1916–2001), Volume 49, Number 1 (2)
- Randomness, arrays, differences and duality (2002) (2)
- Analysis of satellite communications in a multipath environment (1970) (2)
- Coding and Modulation for Code-Division Multiple Accessing* (1999) (2)
- New Extensions and Applications of Welch-Bound-Equality Sequence Sets - (Invited Paper) (2010) (2)
- Review of 'An Introduction to Error-Correcting Codes' (Lin, S.; 1970) (1971) (1)
- Convolutional coding techniques for data protection (1975) (1)
- The Use of Redundant Packets in Slotted-Aloha-Type Random-Access Systems (1978) (1)
- Coordinated design of coding and modulation systems (1976) (1)
- Determining the independence of random variables (1995) (1)
- Optimum modulo 2/sup m/ multidimensional transform diffusion in block ciphers (2003) (1)
- The statistical significance of error probability as determined from decoding simulations for long codes (1976) (1)
- On the Prediction Error of Regularized Models (2000) (0)
- of the Discrete-Time Gaussian with Intersymbol Interference (1988) (0)
- Information Theory, The Copernician System of Communications (1984) (0)
- Processing and Transmission of Information (1967) (0)
- Arthur Kohlenberg 1924-1970 (Obituary) (1971) (0)
- APPLICATIONS OF AUTOMATA THEORY IN CODING (1968) (0)
- Sub-baud coding. [for interference reduction in spread-spectrum communication system] (1976) (0)
- Matrices of Varied Orthogonality and Their Codes (1998) (0)
- Convolutional coding techniques for data protection Quarterly progress report, 16 Nov. 1969 - 15 Feb. 1970 (1969) (0)
- Review of 'Information Theory' (Ash, Robert; 1965) (1966) (0)
- Very easily decodable nonlinear cyclic codes (2002) (0)
- A new look at Shannon bandwidth (2003) (0)
- Convolutional coding techniques for data protection Final report, 16 Sep. 1967 - 15 Sep. 1968 (1969) (0)
- A recommended R equals 1/2, K equals 32, Quick-Look-In convolutional code for NASA use (1975) (0)
- Convolutional coding techniques for data protection Progress report, Aug. 16 - Nov. 15, 1968 (1968) (0)
- Systematic bits are better (2000) (0)
- An upper bound on decoding bit-error probability with linear coding on extremely noisy channels (2001) (0)
- An atypical approach to carrier modulation (2004) (0)
- Sequential Decoding in Space Applications (1971) (0)
- Convolutional coding techniques for data protection Quarterly progress report, 16 Feb. - 15 May 1969 (1969) (0)
- Device for transformation of a digital block and utilizaciondel same. (1991) (0)
- Expires in six months Ascom Systec Ltd. Incorporation of IDEA encryption algorithm in S/MIME (2006) (0)
- Book review (2007) (0)
- On the statistics of imbalance (2001) (0)
- CYRIL MÉASSON, Publications Editor PREDRAG SPASOJEVIc ´, Publications Editor (2010) (0)
- Methods of alleviation of ionospheric scintillation effects on digital communications (1974) (0)
- A generalization of binary minimum shift keying and staggered quadriphase shift keying modulation (1979) (0)
- Comparison of phase modulation systems (1979) (0)
This paper list is powered by the following services:
Other Resources About James Massey
What Schools Are Affiliated With James Massey?
James Massey is affiliated with the following schools:
