Carlos R. P. Hartmann

Publication Activity (10 Years)

Years Active: 1970-2007
Publications (10 Years): 0

Publications

Po-Ning Chen, Yunghsiang S. Han, Carlos R. P. Hartmann, Hong-Bin Wu
Analysis of Sequential Decoding Complexity Using the Berry-Esseen Inequality CoRR (2007)
Yunghsiang S. Han, Carlos R. P. Hartmann, Kishan G. Mehrotra
Decoding Linear Block Codes Using a Priority-First Search : Performance Analysis and Suboptimal Version. IEEE Trans. Inf. Theory 44 (3) (1998)
Ching-Cheng Shih, Christopher R. Wulff, Carlos R. P. Hartmann, Chilukuri K. Mohan
Efficient Heuristic Search Algorithms for Soft-Decision Decoding of Linear Block Codes. IEEE Trans. Inf. Theory 44 (7) (1998)
Yunghsiang S. Han, Carlos R. P. Hartmann
The zero-guards algorithm for general minimum-distance decoding problems. IEEE Trans. Inf. Theory 43 (5) (1997)
D. L. Tao, Carlos R. P. Hartmann, Yunghsing S. (Sam) Han
New Encoding/Decoding Methods for Designing Fault-Tolerant Matrix Operations. IEEE Trans. Parallel Distributed Syst. 7 (9) (1996)
Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney
Parallel Integer Sorting Using Small Operations. Acta Informatica 32 (1) (1995)
Yunghsiang S. Han, Carlos R. P. Hartmann, Chih-Chieh Chen
Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes. IEEE Trans. Inf. Theory 39 (5) (1993)
D. L. Tao, Carlos R. P. Hartmann
A Novel Concurrent Error Detection Scheme for FFT Networks. IEEE Trans. Parallel Distributed Syst. 4 (2) (1993)
Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney
Running ASCEND, DESCEND and PIPELINE Algorithms in Parallel Using Small Processors. Inf. Process. Lett. 46 (1) (1993)
Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney
Towards Optimal Parallel Radix Sorting. IPPS (1993)
Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney
PRAMs with Variable Word-Size. Inf. Process. Lett. 42 (4) (1992)
D. L. Tao, Carlos R. P. Hartmann, Parag K. Lala
A General Technique for Designing Totally Self-Checking Checker for 1-out-of-N Code with Minimum Gate Delay. IEEE Trans. Computers 41 (7) (1992)
D. L. Tao, Eugene Foo, Carlos R. P. Hartmann
A new algorithm-based fault tolerance technique for computing matrix operations. SPDP (1991)
D. L. Tao, Carlos R. P. Hartmann, Parag K. Lala
A Note on t-EC/d-UED Codes. IEEE Trans. Computers 40 (5) (1991)
Warren H. Debany Jr., Carlos R. P. Hartmann, Pramod K. Varshney, Kishan G. Mehrotra
Comparison of Random Test Vector Generation Strategies. ICCAD (1991)
Warren H. Debany Jr., Carlos R. P. Hartmann
Bounds on the sizes of irredundant test sets and sequences for combinational logic networks. J. Electron. Test. 2 (4) (1991)
D. L. Tao, Carlos R. P. Hartmann, Y. S. Chen
A novel concurrent error detection scheme for FFT networks. FTCS (1990)
D. L. Tao, Carlos R. P. Hartmann, Parag K. Lala
An efficient class of unidirectional error detecting/correcting codes. IEEE Trans. Computers 37 (6) (1988)
Jiapeng Gao, Luther D. Rudolph, Carlos R. P. Hartmann
Iteratively maximum likelihood decodable spherical codes and a method for their construction. IEEE Trans. Inf. Theory 34 (3) (1988)
D. L. Tao, Carlos R. P. Hartmann, Parag K. Lala
A Concurrent Testing Strategy for PLAs. ITC (1986)
Lev B. Levitin, Carlos R. P. Hartmann
A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm. IEEE Trans. Inf. Theory 31 (3) (1985)
Nandakumar N. Tendolkar, Carlos R. P. Hartmann
Generalization of chase algorithms for soft decision decoding of binary linear codes. IEEE Trans. Inf. Theory 30 (5) (1984)
Pramod K. Varshney, Carlos R. P. Hartmann
Sequential Fault Diagnosis of Modular Systems. IEEE Trans. Computers 33 (2) (1984)
K. H. Farrell, Luther D. Rudolph, Carlos R. P. Hartmann, L. D. Nielsen
Decoding by local optimization. IEEE Trans. Inf. Theory 29 (5) (1983)
Pramod K. Varshney, Carlos R. P. Hartmann, Jamie M. de Faria Jr.
Application of Information Theory to Sequential Fault Diagnosis. IEEE Trans. Computers 31 (2) (1982)
Carlos R. P. Hartmann, Pramod K. Varshney, Kishan G. Mehrotra, Carl L. Gerberich
Application of information theory to the construction of efficient decision trees. IEEE Trans. Inf. Theory 28 (4) (1982)
Sumit Dasgupta, Carlos R. P. Hartmann, Luther D. Rudolph
Dual-Mode Logic for Function-Independent Fault Testing. IEEE Trans. Computers 29 (11) (1980)
Luther D. Rudolph, Carlos R. P. Hartmann, Tai-Yang Hwang, Nguyen Duc
Algebraic analog decoding of linear binary codes. IEEE Trans. Inf. Theory 25 (4) (1979)
Tai-Yang Hwang, Carlos R. P. Hartmann
Some results on arithmetic codes of composite length. IEEE Trans. Inf. Theory 24 (1) (1978)
John Knaizuk Jr., Carlos R. P. Hartmann
An Optimal Algorithm for Testing Stuck-at Faults in Random Access Memories. IEEE Trans. Computers 26 (11) (1977)
Carlos R. P. Hartmann, Luther D. Rudolph, Kishan G. Mehrotra
Asymptotic performance of optimum bit-by-bit decoding for the white Gaussian channel (Corresp.). IEEE Trans. Inf. Theory 23 (4) (1977)
John Knaizuk Jr., Carlos R. P. Hartmann
An Algorithm for Testing Random Access Memories. IEEE Trans. Computers 26 (4) (1977)
Carlos R. P. Hartmann, Luther D. Rudolph
An optimum symbol-by-symbol decoding rule for linear codes. IEEE Trans. Inf. Theory 22 (5) (1976)
Carlos R. P. Hartmann, Tai-Yang Hwang
Some results on the weight structure of cyclic codes of composite length. IEEE Trans. Inf. Theory 22 (3) (1976)
Carlos R. P. Hartmann, Ralph J. Longobardi
Weight distributions of some classes of binary cyclic codes (Corresp.). IEEE Trans. Inf. Theory 21 (3) (1975)
Tai-Yang Hwang, Carlos R. P. Hartmann
Correction to a proof in the coding literature (Corresp.). IEEE Trans. Inf. Theory 21 (3) (1975)
J. R. Riek, Carlos R. P. Hartmann, Luther D. Rudolph
Majority decoding of some classes of binary cyclic codes. IEEE Trans. Inf. Theory 20 (5) (1974)
Carlos R. P. Hartmann, James B. Ducey, Luther D. Rudolph
On the structure of generalized finite-geometry codes. IEEE Trans. Inf. Theory 20 (2) (1974)
Carlos R. P. Hartmann, Kenneth K. Tzeng
Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.). IEEE Trans. Inf. Theory 20 (2) (1974)
Carlos R. P. Hartmann, Kenneth K. Tzeng
On some classes of cyclic codes of composite length (Corresp.). IEEE Trans. Inf. Theory 19 (6) (1973)
Luther D. Rudolph, Carlos R. P. Hartmann
Decoding by sequential code reduction. IEEE Trans. Inf. Theory 19 (4) (1973)
Carlos R. P. Hartmann, Kenneth K. Tzeng
Generalizations of the BCH Bound Inf. Control. 20 (5) (1972)
Carlos R. P. Hartmann, Kenneth K. Tzeng, Robert T. Chien
Some results on the minimum distance structure of cyclic codes. IEEE Trans. Inf. Theory 18 (3) (1972)
Carlos R. P. Hartmann, Kenneth K. Tzeng
A bound for arithmetic codes of composite length (Corresp.). IEEE Trans. Inf. Theory 18 (2) (1972)
Carlos R. P. Hartmann
Decoding beyond the BCH bound (Corresp.). IEEE Trans. Inf. Theory 18 (3) (1972)
Carlos R. P. Hartmann, Kenneth K. Tzeng
A bound for cyclic codes of composite length (Corresp.). IEEE Trans. Inf. Theory 18 (2) (1972)
Carlos R. P. Hartmann
A note on the minimum distance structure of cyclic codes (Corresp.). IEEE Trans. Inf. Theory 18 (3) (1972)
Carlos R. P. Hartmann
A note on the decoding of double-error-correcting binary BCH codes of primitive length (Corresp.). IEEE Trans. Inf. Theory 17 (6) (1971)
Kenneth K. Tzeng, Carlos R. P. Hartmann
On the minimum distance of certain reversible cyclic codes (Corresp.). IEEE Trans. Inf. Theory 16 (5) (1970)