Author

Carlos R. P. Hartmann

Observed names: C. Hartmann, C. R. P. Hartmann, C.R.P. Hartmann, Carlos R. Hartmann, Carlos R.P. Hartmann, Hartmann, Carlos R. P., Hartmann, Carlos R.P.

Observed institutions: IBM (United States), University of Miami, University of Illinois Urbana-Champaign, The University of Texas at Dallas, United States Air Force Academy, Rome Laboratory, Stony Brook University, Syracuse University

ORCID: 0009-0007-5067-589X

Observed ORCID: 0009-0007-5067-589X

OpenAlex ID: A5111947581

An optimum symbol-by-symbol decoding rule for linear codes

1976 · C. Hartmann, L. Rudolph · IEEE Transactions on Information Theory · 193

Generalizations of the BCH bound

1972 · C.R.P. Hartmann, K.K. Tzeng · Information and Control · 156

Application of information theory to the construction of efficient decision trees

1982 · C. Hartmann, P. Varshney, et al. · IEEE Transactions on Information Theory · 105

On the minimum distance of certain reversible cyclic codes (Corresp.)

1970 · K. Tzeng, C. Hartmann · IEEE Transactions on Information Theory · 54

A novel concurrent error detection scheme for FFT networks

1993 · D.L. Tao, C.R.P. Hartmann · IEEE Transactions on Parallel and Distributed Systems · 48

Decoding beyond the BCH bound (Corresp.)

1972 · C. Hartmann · IEEE Transactions on Information Theory · 43

An efficient class of unidirectional error detecting/correcting codes

1988 · D.L. Tao, C.R.P. Hartmann, et al. · IEEE Transactions on Computers · 41

A novel concurrent error detection scheme for FFT networks

2002 · D.L. Tao, C.R.P. Hartmann, et al. · 35

A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm

1985 · L. Levitin, C. Hartmann · IEEE Transactions on Information Theory · 34

Decoding beyond the BCH bound

1971 · C. Hartmann · NASA Technical Reports Server (NASA) · 30

Generalization of chase algorithms for soft decision decoding of binary linear codes

1984 · N. Tendolkar, C. Hartmann · IEEE Transactions on Information Theory · 29

Network Reliability Evaluation Using Probability Expressions

1986 · W. H. Debany, P. K. Varshney, et al. · IEEE Transactions on Reliability · 26

Some results on the minimum distance structure of cyclic codes

1972 · C. Hartmann, K. Tzeng, et al. · IEEE Transactions on Information Theory · 24

A general technique for designing totally self-checking checker for 1-out-of-N code with minimum gate delay

1992 · D.L. Tao, C.R.P. Hartmann, et al. · IEEE Transactions on Computers · 23

Efficient Maximum-Likelihood Soft-Decision Decoding of Linear Block Codes Using Algorithm A*

2005 · Yunghsiang S. Han, C.R.P. Hartmann, et al. · IEEE International Symposium on Information Theory (ISIT) · 22

PDF

Algebraic analog decoding of linear binary codes

1979 · L. Rudolph, C. Hartmann, et al. · IEEE Transactions on Information Theory · 21

Decoding linear block codes using a priority-first search: performance analysis and suboptimal version

1998 · Y.S. Han, C.R.P. Hartmann, et al. · IEEE Transactions on Information Theory · 20

Decoding Beyond the BCH Bound Using Multiple Sets of Syndrome Sequences

1974 · C. Hartmann, K.K. Tzeng · 20

Decoding by local optimization (Corresp.)

1983 · K. Farrell, L. Rudolph, et al. · IEEE Transactions on Information Theory · 19

Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)

1974 · C. Hartmann, K. Tzeng · IEEE Transactions on Information Theory · 18

Efficient heuristic search algorithms for soft-decision decoding of linear block codes

1998 · Ching-Cheng Shih, C.R. Wulff, et al. · IEEE Transactions on Information Theory · 17

On the structure of generalized finite-geometry codes

1974 · C. Hartmann, J. Ducey, et al. · IEEE Transactions on Information Theory · 15

A MOS implementation of totally self-checking checker for the 1-out-of-3 code

1988 · D.L. Tao, P.K. Lala, et al. · IEEE Journal of Solid-State Circuits · 14

Decoding by sequential code reduction

1973 · L. Rudolph, C. Hartmann · IEEE Transactions on Information Theory · 12

A note on the decoding of double-error-correcting binary BCH codes of primitive length (Corresp.)

1971 · C. Hartmann · IEEE Transactions on Information Theory · 12

Works count: 89

Citation count: 1,199

H-index: 19

I10-index: 26