Carlos R. P. Hartmann

According to our database, Carlos R. P. Hartmann authored at least 50 papers between 1970 and 2007.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2007

Analysis of Sequential Decoding Complexity Using the Berry-Esseen Inequality

Po-Ning Chen, Yunghsiang S. Han, Carlos R. P. Hartmann, Hong-Bin Wu

CoRR, 2007

1998

Efficient Heuristic Search Algorithms for Soft-Decision Decoding of Linear Block Codes.

Ching-Cheng Shih, Christopher R. Wulff, Carlos R. P. Hartmann, Chilukuri K. Mohan

IEEE Trans. Inf. Theory, 1998

Decoding Linear Block Codes Using a Priority-First Search : Performance Analysis and Suboptimal Version.

Yunghsiang S. Han, Carlos R. P. Hartmann, Kishan G. Mehrotra

IEEE Trans. Inf. Theory, 1998

1997

The zero-guards algorithm for general minimum-distance decoding problems.

Yunghsiang S. Han, Carlos R. P. Hartmann

IEEE Trans. Inf. Theory, 1997

1996

New Encoding/Decoding Methods for Designing Fault-Tolerant Matrix Operations.

Dali L. Tao, Carlos R. P. Hartmann, Yunghsing S. (Sam) Han

IEEE Trans. Parallel Distributed Syst., 1996

1995

Parallel Integer Sorting Using Small Operations.

Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney

Acta Informatica, 1995

1993

A Novel Concurrent Error Detection Scheme for FFT Networks.

Dali L. Tao, Carlos R. P. Hartmann

IEEE Trans. Parallel Distributed Syst., 1993

Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes.

Yunghsiang S. Han, Carlos R. P. Hartmann, Chih-Chieh Chen

IEEE Trans. Inf. Theory, 1993

Running ASCEND, DESCEND and PIPELINE Algorithms in Parallel Using Small Processors.

Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney

Inf. Process. Lett., 1993

Towards Optimal Parallel Radix Sorting.

Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney

Proceedings of the Seventh International Parallel Processing Symposium, 1993

1992

A General Technique for Designing Totally Self-Checking Checker for 1-out-of-N Code with Minimum Gate Delay.

Dali L. Tao, Carlos R. P. Hartmann, Parag K. Lala

IEEE Trans. Computers, 1992

PRAMs with Variable Word-Size.

Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney

Inf. Process. Lett., 1992

1991

A Note on t-EC/d-UED Codes.

Dali L. Tao, Carlos R. P. Hartmann, Parag K. Lala

IEEE Trans. Computers, 1991

Bounds on the sizes of irredundant test sets and sequences for combinational logic networks.

Warren H. Debany Jr., Carlos R. P. Hartmann

J. Electron. Test., 1991

A new algorithm-based fault tolerance technique for computing matrix operations.

Dali L. Tao, Eugene Foo, Carlos R. P. Hartmann

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Comparison of Random Test Vector Generation Strategies.

Warren H. Debany Jr., Carlos R. P. Hartmann, Pramod K. Varshney, Kishan G. Mehrotra

Proceedings of the 1991 IEEE/ACM International Conference on Computer-Aided Design, 1991

1990

A novel concurrent error detection scheme for FFT networks.

Dali L. Tao, Carlos R. P. Hartmann, Y. S. Chen

Proceedings of the 20th International Symposium on Fault-Tolerant Computing, 1990

1988

Iteratively maximum likelihood decodable spherical codes and a method for their construction.

Jiapeng Gao, Luther D. Rudolph, Carlos R. P. Hartmann

IEEE Trans. Inf. Theory, 1988

An efficient class of unidirectional error detecting/correcting codes.

Dali L. Tao, Carlos R. P. Hartmann, Parag K. Lala

IEEE Trans. Computers, 1988

1986

A Concurrent Testing Strategy for PLAs.

Dali L. Tao, Carlos R. P. Hartmann, Parag K. Lala

Proceedings of the Proceedings International Test Conference 1986, 1986

1985

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

Lev B. Levitin, Carlos R. P. Hartmann

IEEE Trans. Inf. Theory, 1985

1984

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

Nandakumar N. Tendolkar, Carlos R. P. Hartmann

IEEE Trans. Inf. Theory, 1984

Sequential Fault Diagnosis of Modular Systems.

Pramod K. Varshney, Carlos R. P. Hartmann

IEEE Trans. Computers, 1984

1983

Decoding by local optimization.

K. H. Farrell, Luther D. Rudolph, Carlos R. P. Hartmann, L. D. Nielsen

IEEE Trans. Inf. Theory, 1983

1982

Application of information theory to the construction of efficient decision trees.

Carlos R. P. Hartmann, Pramod K. Varshney, Kishan G. Mehrotra, Carl L. Gerberich

IEEE Trans. Inf. Theory, 1982

Application of Information Theory to Sequential Fault Diagnosis.

Pramod K. Varshney, Carlos R. P. Hartmann, Jamie M. de Faria Jr.

IEEE Trans. Computers, 1982

1980

Dual-Mode Logic for Function-Independent Fault Testing.

Sumit Dasgupta, Carlos R. P. Hartmann, Luther D. Rudolph

IEEE Trans. Computers, 1980

1979

Algebraic analog decoding of linear binary codes.

Luther D. Rudolph, Carlos R. P. Hartmann, Tai-Yang Hwang, Nguyen Duc

IEEE Trans. Inf. Theory, 1979

1978

Some results on arithmetic codes of composite length.

Tai-Yang Hwang, Carlos R. P. Hartmann

IEEE Trans. Inf. Theory, 1978

1977

Asymptotic performance of optimum bit-by-bit decoding for the white Gaussian channel (Corresp.).

Carlos R. P. Hartmann, Luther D. Rudolph, Kishan G. Mehrotra

IEEE Trans. Inf. Theory, 1977

An Optimal Algorithm for Testing Stuck-at Faults in Random Access Memories.

John Knaizuk Jr., Carlos R. P. Hartmann

IEEE Trans. Computers, 1977

An Algorithm for Testing Random Access Memories.

John Knaizuk Jr., Carlos R. P. Hartmann

IEEE Trans. Computers, 1977

1976

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

Carlos R. P. Hartmann, Luther D. Rudolph

IEEE Trans. Inf. Theory, 1976

Some results on the weight structure of cyclic codes of composite length.

Carlos R. P. Hartmann, Tai-Yang Hwang

IEEE Trans. Inf. Theory, 1976

1975

Correction to a proof in the coding literature (Corresp.).

Tai-Yang Hwang, Carlos R. P. Hartmann

IEEE Trans. Inf. Theory, 1975

Weight distributions of some classes of binary cyclic codes (Corresp.).

Carlos R. P. Hartmann, Ralph J. Longobardi

IEEE Trans. Inf. Theory, 1975

1974

Majority decoding of some classes of binary cyclic codes.

J. R. Riek, Carlos R. P. Hartmann, Luther D. Rudolph

IEEE Trans. Inf. Theory, 1974

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

Carlos R. P. Hartmann, Kenneth K. Tzeng

IEEE Trans. Inf. Theory, 1974

On the structure of generalized finite-geometry codes.

Carlos R. P. Hartmann, James B. Ducey, Luther D. Rudolph

IEEE Trans. Inf. Theory, 1974

1973

Decoding by sequential code reduction.

Luther D. Rudolph, Carlos R. P. Hartmann

IEEE Trans. Inf. Theory, 1973

On some classes of cyclic codes of composite length (Corresp.).

Carlos R. P. Hartmann, Kenneth K. Tzeng

IEEE Trans. Inf. Theory, 1973

1972

Generalizations of the BCH Bound

Carlos R. P. Hartmann, Kenneth K. Tzeng

Inf. Control., June, 1972

Some results on the minimum distance structure of cyclic codes.

Carlos R. P. Hartmann, Kenneth K. Tzeng, Robert T. Chien

IEEE Trans. Inf. Theory, 1972

A bound for arithmetic codes of composite length (Corresp.).

Carlos R. P. Hartmann, Kenneth K. Tzeng

IEEE Trans. Inf. Theory, 1972

A bound for cyclic codes of composite length (Corresp.).

Carlos R. P. Hartmann, Kenneth K. Tzeng

IEEE Trans. Inf. Theory, 1972

Decoding beyond the BCH bound (Corresp.).

Carlos R. P. Hartmann

IEEE Trans. Inf. Theory, 1972

A note on the minimum distance structure of cyclic codes (Corresp.).

Carlos R. P. Hartmann

IEEE Trans. Inf. Theory, 1972

1971

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

Carlos R. P. Hartmann

IEEE Trans. Inf. Theory, 1971

1970

On the Minimum Distance Structure of Cyclic Codes and Decoding Beyond Thebch Bound

Carlos R. P. Hartmann

PhD thesis, 1970

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

Kenneth K. Tzeng, Carlos R. P. Hartmann

IEEE Trans. Inf. Theory, 1970