Carlos R. P. Hartmann

According to our database1, Carlos R. P. Hartmann
  • authored at least 48 papers between 1970 and 2007.
  • has a "Dijkstra number"2 of five.

Awards

IEEE Fellow

IEEE Fellow 1993, "For contributions to coding theory, particularly for soft decision decoding of linear codes.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2007
Analysis of Sequential Decoding Complexity Using the Berry-Esseen Inequality
CoRR, 2007

1998
Efficient Heuristic Search Algorithms for Soft-Decision Decoding of Linear Block Codes.
IEEE Trans. Information Theory, 1998

Decoding Linear Block Codes Using a Priority-First Search : Performance Analysis and Suboptimal Version.
IEEE Trans. Information Theory, 1998

1997
The zero-guards algorithm for general minimum-distance decoding problems.
IEEE Trans. Information Theory, 1997

1996
New Encoding/Decoding Methods for Designing Fault-Tolerant Matrix Operations.
IEEE Trans. Parallel Distrib. Syst., 1996

1995
Parallel Integer Sorting Using Small Operations.
Acta Inf., 1995

1993
A Novel Concurrent Error Detection Scheme for FFT Networks.
IEEE Trans. Parallel Distrib. Syst., 1993

Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes.
IEEE Trans. Information Theory, 1993

Running ASCEND, DESCEND and PIPELINE Algorithms in Parallel Using Small Processors.
Inf. Process. Lett., 1993

Towards Optimal Parallel Radix Sorting.
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.
IEEE Trans. Computers, 1992

PRAMs with Variable Word-Size.
Inf. Process. Lett., 1992

1991
A Note on t-EC/d-UED Codes.
IEEE Trans. Computers, 1991

Bounds on the sizes of irredundant test sets and sequences for combinational logic networks.
J. Electronic Testing, 1991

A new algorithm-based fault tolerance technique for computing matrix operations.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Comparison of Random Test Vector Generation Strategies.
Proceedings of the 1991 IEEE/ACM International Conference on Computer-Aided Design, 1991

1990
A novel concurrent error detection scheme for FFT networks.
Proceedings of the 20th International Symposium on Fault-Tolerant Computing, 1990

1988
Iteratively maximum likelihood decodable spherical codes and a method for their construction.
IEEE Trans. Information Theory, 1988

1986
A Concurrent Testing Strategy for PLAs.
Proceedings of the Proceedings International Test Conference 1986, 1986

1985
A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm.
IEEE Trans. Information Theory, 1985

1984
Generalization of chase algorithms for soft decision decoding of binary linear codes.
IEEE Trans. Information Theory, 1984

Sequential Fault Diagnosis of Modular Systems.
IEEE Trans. Computers, 1984

1983
Decoding by local optimization.
IEEE Trans. Information Theory, 1983

1982
Application of information theory to the construction of efficient decision trees.
IEEE Trans. Information Theory, 1982

Application of Information Theory to Sequential Fault Diagnosis.
IEEE Trans. Computers, 1982

1980
Dual-Mode Logic for Function-Independent Fault Testing.
IEEE Trans. Computers, 1980

1979
Algebraic analog decoding of linear binary codes.
IEEE Trans. Information Theory, 1979

1978
Some results on arithmetic codes of composite length.
IEEE Trans. Information Theory, 1978

1977
Asymptotic performance of optimum bit-by-bit decoding for the white Gaussian channel (Corresp.).
IEEE Trans. Information Theory, 1977

An Optimal Algorithm for Testing Stuck-at Faults in Random Access Memories.
IEEE Trans. Computers, 1977

An Algorithm for Testing Random Access Memories.
IEEE Trans. Computers, 1977

1976
An optimum symbol-by-symbol decoding rule for linear codes.
IEEE Trans. Information Theory, 1976

Some results on the weight structure of cyclic codes of composite length.
IEEE Trans. Information Theory, 1976

1975
Correction to a proof in the coding literature (Corresp.).
IEEE Trans. Information Theory, 1975

Weight distributions of some classes of binary cyclic codes (Corresp.).
IEEE Trans. Information Theory, 1975

1974
Majority decoding of some classes of binary cyclic codes.
IEEE Trans. Information Theory, 1974

Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.).
IEEE Trans. Information Theory, 1974

On the structure of generalized finite-geometry codes.
IEEE Trans. Information Theory, 1974

1973
Decoding by sequential code reduction.
IEEE Trans. Information Theory, 1973

On some classes of cyclic codes of composite length (Corresp.).
IEEE Trans. Information Theory, 1973

1972
Generalizations of the BCH Bound
Information and Control, June, 1972

Some results on the minimum distance structure of cyclic codes.
IEEE Trans. Information Theory, 1972

A bound for arithmetic codes of composite length (Corresp.).
IEEE Trans. Information Theory, 1972

A bound for cyclic codes of composite length (Corresp.).
IEEE Trans. Information Theory, 1972

Decoding beyond the BCH bound (Corresp.).
IEEE Trans. Information Theory, 1972

A note on the minimum distance structure of cyclic codes (Corresp.).
IEEE Trans. Information Theory, 1972

1971
A note on the decoding of double-error-correcting binary BCH codes of primitive length (Corresp.).
IEEE Trans. Information Theory, 1971

1970
On the minimum distance of certain reversible cyclic codes (Corresp.).
IEEE Trans. Information Theory, 1970


  Loading...