E. F. Assmus

1.4k total citations
38 papers, 786 citations indexed

About

E. F. Assmus is a scholar working on Electrical and Electronic Engineering, Artificial Intelligence and Discrete Mathematics and Combinatorics. According to data from OpenAlex, E. F. Assmus has authored 38 papers receiving a total of 786 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Electrical and Electronic Engineering, 26 papers in Artificial Intelligence and 12 papers in Discrete Mathematics and Combinatorics. Recurrent topics in E. F. Assmus's work include graph theory and CDMA systems (26 papers), Coding theory and cryptography (25 papers) and Finite Group Theory Research (12 papers). E. F. Assmus is often cited by papers focused on graph theory and CDMA systems (26 papers), Coding theory and cryptography (25 papers) and Finite Group Theory Research (12 papers). E. F. Assmus collaborates with scholars based in United States, United Kingdom and Netherlands. E. F. Assmus's co-authors include H. F. Mattson, J. D. Key, Vera Pless, J. H. van Lint and J.-M. Goethals and has published in prestigious journals such as Nature, IEEE Transactions on Information Theory and SIAM Review.

In The Last Decade

E. F. Assmus

38 papers receiving 678 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
E. F. Assmus United States 17 644 550 274 183 174 38 786
H. F. Mattson United States 13 730 1.1× 589 1.1× 231 0.8× 259 1.4× 200 1.1× 34 827
Philippe Delsarte Belgium 8 315 0.5× 270 0.5× 165 0.6× 105 0.6× 85 0.5× 16 444
A. A. Nechaev Russia 13 526 0.8× 363 0.7× 247 0.9× 91 0.5× 137 0.8× 60 658
Simeon Ball Spain 16 576 0.9× 427 0.8× 404 1.5× 164 0.9× 130 0.7× 54 732
Zhe-Xian Wan China 14 409 0.6× 285 0.5× 293 1.1× 121 0.7× 157 0.9× 57 628
Yves Edel Germany 15 526 0.8× 352 0.6× 255 0.9× 58 0.3× 196 1.1× 39 684
Jürgen Bierbrauer United States 14 416 0.6× 295 0.5× 184 0.7× 69 0.4× 137 0.8× 63 537
Wolfgang M. Willems Germany 13 456 0.7× 301 0.5× 327 1.2× 149 0.8× 80 0.5× 82 580
Aart Blokhuis Netherlands 14 443 0.7× 389 0.7× 462 1.7× 60 0.3× 122 0.7× 55 656
J. D. Key United States 14 588 0.9× 442 0.8× 298 1.1× 289 1.6× 83 0.5× 77 657

Countries citing papers authored by E. F. Assmus

Since Specialization
Citations

This map shows the geographic impact of E. F. Assmus's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by E. F. Assmus with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites E. F. Assmus more than expected).

Fields of papers citing papers by E. F. Assmus

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by E. F. Assmus. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by E. F. Assmus. The network helps show where E. F. Assmus may publish in the future.

Co-authorship network of co-authors of E. F. Assmus

This figure shows the co-authorship network connecting the top 25 collaborators of E. F. Assmus. A scholar is included among the top collaborators of E. F. Assmus based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with E. F. Assmus. E. F. Assmus is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Assmus, E. F.. (1998). The category of linear codes. IEEE Transactions on Information Theory. 44(2). 612–629. 8 indexed citations
2.
Assmus, E. F. & J. D. Key. (1992). Hadamard matrices and their designs: a coding-theoretic approach. Transactions of the American Mathematical Society. 330(1). 269–293. 16 indexed citations
3.
Assmus, E. F.. (1992). On the Reed-Muller codes. Discrete Mathematics. 106-107. 25–33. 6 indexed citations
4.
Assmus, E. F., et al.. (1991). Biplanes and near biplanes. Journal of Geometry. 40(1-2). 1–14. 3 indexed citations
5.
Assmus, E. F. & J. D. Key. (1990). Affine and projective planes. Discrete Mathematics. 83(2-3). 161–187. 82 indexed citations
6.
Assmus, E. F. & J. D. Key. (1990). Translation planes and derivation sets. Journal of Geometry. 37(1-2). 3–16. 9 indexed citations
7.
Assmus, E. F. & J. D. Key. (1989). Arcs and Ovals in the Hermitian and Ree Unitals. European Journal of Combinatorics. 10(4). 297–308. 12 indexed citations
8.
Assmus, E. F. & Vera Pless. (1983). On the coveting radius of extremal self-dual codes. IEEE Transactions on Information Theory. 29(3). 359–363. 37 indexed citations
9.
Assmus, E. F. & J. H. van Lint. (1979). Ovals in projective designs. Journal of Combinatorial Theory Series A. 27(3). 307–324. 21 indexed citations
10.
Assmus, E. F., et al.. (1979). The (16, 16, 2) designs. International Journal of Mathematics and Mathematical Sciences. 2(2). 261–281. 16 indexed citations
11.
Assmus, E. F., et al.. (1978). Nonexistence Proofs for Projective Designs. American Mathematical Monthly. 85(2). 110–112. 2 indexed citations
12.
Assmus, E. F., J.-M. Goethals, & H. F. Mattson. (1976). Generalized t-designs and majority decoding of linear codes. Information and Control. 32(1). 43–60. 10 indexed citations
13.
Assmus, E. F. & H. F. Mattson. (1976). Some 3-error-correcting BCH codes have covering radius 5 (Corresp.). IEEE Transactions on Information Theory. 22(3). 348–349. 18 indexed citations
14.
Assmus, E. F.. (1976). Finite geometries and designs. Nature. 259(5543). 512–512. 16 indexed citations
15.
Assmus, E. F., et al.. (1974). Self-orthogonal Steiner systems and projective planes. Mathematische Zeitschrift. 138(1). 89–96. 10 indexed citations
16.
Assmus, E. F. & H. F. Mattson. (1972). Contractions of self-orthogonal codes. Discrete Mathematics. 3(1-3). 21–32. 3 indexed citations
17.
Assmus, E. F. & H. F. Mattson. (1972). On weights in quadratic-residue codes. Discrete Mathematics. 3(1-3). 1–20. 21 indexed citations
18.
Assmus, E. F. & H. F. Mattson. (1969). New 5-designs. Journal of Combinatorial Theory. 6(2). 122–151. 216 indexed citations
19.
Assmus, E. F. & H. F. Mattson. (1967). On tactical configurations and error-correcting codes. Journal of Combinatorial Theory. 2(3). 243–257. 28 indexed citations
20.
Assmus, E. F. & H. F. Mattson. (1966). On the number of inequivalent steiner triple systems. Journal of Combinatorial Theory. 1(3). 301–305. 16 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by H. F. Mattson Breakdown of academic impact, for papers by Philippe Delsarte Breakdown of academic impact, for papers by A. A. Nechaev Breakdown of academic impact, for papers by Simeon Ball Breakdown of academic impact, for papers by Zhe-Xian Wan Breakdown of academic impact, for papers by Yves Edel Breakdown of academic impact, for papers by Jürgen Bierbrauer Breakdown of academic impact, for papers by Wolfgang M. Willems Breakdown of academic impact, for papers by Aart Blokhuis Breakdown of academic impact, for papers by J. D. Key
Rankless by CCL
2026