L. D. Baumert
Impact in
-
- Finite Group Theory Research
- Artificial Intelligence top 2%
- Coding theory and cryptography
Papers in
- Co-authors
- Solomon W. GolombRobert J. McElieceMarshall HallWilliam Hobson MillsR. L. WardHarold FredricksenJohannes MykkeltveitS. W. Golomb
- Journals
- IEEE Transactions on Information Theory (3 papers)Pacific Journal of Mathematics (2 papers)Bulletin of the American Mathematical Society (2 papers)Mathematics of Computation (2 papers)Lecture notes in mathematics (1 paper)
- Partner nations
- United StatesNetherlands
In The Last Decade
L. D. Baumert
26 papers receiving 1.0k citations
Peers
Comparison fields: 5 of 90
- Discrete Mathematics and Combinatorics 183
- Artificial Intelligence 614
- Computational Theory and Mathematics 287
- Computer Networks and Communications 295
- Algebra and Number Theory 59
Countries citing papers authored by L. D. Baumert
This map shows the geographic impact of L. D. Baumert'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 L. D. Baumert with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites L. D. Baumert more than expected).
Fields of papers citing papers by L. D. Baumert
This network shows the impact of papers produced by L. D. Baumert. 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 L. D. Baumert. The network helps show where L. D. Baumert may publish in the future.
Co-authorship network
The 12 scholars most cited alongside L. D. Baumert, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 1982 | 54 | |
| 2 | Coding for optical channels | 1979 | 1 |
| 3 | 1979 | 10 | |
| 4 | Soft decision decoding of block codes | 1978 | 7 |
| 5 | Minimum-Weight Codewords in the (12864) BCH Code | 1977 | 1 |
| 6 | Decoding with multipliers | 1976 | 3 |
| 7 | Weight Distributions of Some Irreducible Cyclic Codes | 1973 | 30 |
| 8 | 1973 | 30 | |
| 9 | A Golay-Viterbi Concatenated Coding Scheme for MJS'77 | 1973 | 0 |
| 10 | 1973 | 4 | |
| 11 | 1973 | 0 | |
| 12 | 1972 | 114 | |
| 13 | 1967 | 44 | |
| 14 | 1965 | 28 | |
| 15 | 1965 | 39 | |
| 16 | Codes with special correlation. | 1964 | 1 |
| 17 | Generation of specified sequences. | 1964 | 2 |
| 18 | 1963 | 20 | |
| 19 | 1962 | 42 | |
| 20 | Table of period generators | 1962 | 0 |
About L. D. Baumert
L. D. Baumert is a scholar working on Theoretical Computer Science, Algebra and Number Theory, Artificial Intelligence, Geometry and Topology and Computational Theory and Mathematics, having authored 29 papers that have together received 1.2k indexed citations. Recurring topics across this work include graph theory and CDMA systems (13 papers), Coding theory and cryptography (8 papers), Advanced Wireless Communication Techniques (5 papers), Error Correcting Code Techniques (4 papers), Cellular Automata and Applications (3 papers), Mathematics and Applications (2 papers), Algorithms and Data Compression (2 papers) and Algebraic Geometry and Number Theory (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (183 citations), Artificial Intelligence (614 citations), Computational Theory and Mathematics (287 citations), Computer Networks and Communications (295 citations) and Algebra and Number Theory (59 citations). L. D. Baumert has collaborated with scholars based in United States and Netherlands. Frequent co-authors include Solomon W. Golomb, Robert J. McEliece, Marshall Hall, William Hobson Mills, R. L. Ward, Harold Fredricksen, Johannes Mykkeltveit, S. W. Golomb, H. van Tilborg and L. R. Welch. Their work appears in journals such as IEEE Transactions on Information Theory, Pacific Journal of Mathematics, Bulletin of the American Mathematical Society, Mathematics of Computation and Lecture notes in mathematics.
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.