Carlos R. P. Hartmann

From MaRDI portal
Revision as of 10:42, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1198061

Available identifiers

zbMath Open hartmann.carlos-r-pMaRDI QIDQ1198061

List of research outcomes





PublicationDate of PublicationType
A note on t-EC/d-UED codes2018-09-14Paper
Efficient heuristic search algorithms for soft-decision decoding of linear block codes1999-11-21Paper
Decoding linear block codes using a priority-first search: performance analysis and suboptimal version1998-10-18Paper
The zero-guards algorithm for general minimum-distance decoding problems1998-05-03Paper
Parallel integer sorting using small operations1995-03-22Paper
Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes1994-10-03Paper
Running ASCEND, DESCEND and PIPELINE algorithms in parallel using small processors1993-05-23Paper
PRAMs with variable word-size1993-01-16Paper
An efficient class of unidirectional error detecting/correcting codes1988-01-01Paper
Iteratively maximum likelihood decodable spherical codes and a method for their construction1988-01-01Paper
Network Reliability Evaluation Using Probability Expressions1986-01-01Paper
A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm1985-01-01Paper
Generalization of chase algorithms for soft decision decoding of binary linear codes1984-01-01Paper
Decoding by local optimization (Corresp.)1983-01-01Paper
Application of information theory to the construction of efficient decision trees1982-01-01Paper
Application of Information Theory to Sequential Fault Diagnosis1982-01-01Paper
Dual-Mode Logic for Function-Independent Fault Testing1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38644211979-01-01Paper
Algebraic analog decoding of linear binary codes1979-01-01Paper
Some results on arithmetic codes of composite length1978-01-01Paper
An Algorithm for Testing Random Access Memories1977-01-01Paper
Asymptotic performance of optimum bit-by-bit decoding for the white Gaussian channel (Corresp.)1977-01-01Paper
Some results on the weight structure of cyclic codes of composite length1976-01-01Paper
An optimum symbol-by-symbol decoding rule for linear codes1976-01-01Paper
Weight distributions of some classes of binary cyclic codes (Corresp.)1975-01-01Paper
Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)1974-01-01Paper
On the structure of generalized finite-geometry codes1974-01-01Paper
Majority decoding of some classes of binary cyclic codes1974-01-01Paper
Decoding by sequential code reduction1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44041281973-01-01Paper
On some classes of cyclic codes of composite length (Corresp.)1973-01-01Paper
A bound for cyclic codes of composite length (Corresp.)1972-01-01Paper
A note on the minimum distance structure of cyclic codes (Corresp.)1972-01-01Paper
Decoding beyond the BCH bound (Corresp.)1972-01-01Paper
Generalizations of the BCH bound1972-01-01Paper
Some results on the minimum distance structure of cyclic codes1972-01-01Paper
A note on the decoding of double-error-correcting binary BCH codes of primitive length (Corresp.)1971-01-01Paper
On the minimum distance of certain reversible cyclic codes (Corresp.)1970-01-01Paper

Research outcomes over time

This page was built for person: Carlos R. P. Hartmann