The following pages link to Carlos R. P. Hartmann (Q1198061):
Displaying 38 items.
- PRAMs with variable word-size (Q1198062) (← links)
- Running ASCEND, DESCEND and PIPELINE algorithms in parallel using small processors (Q1210315) (← links)
- Parallel integer sorting using small operations (Q1346223) (← links)
- Generalization of chase algorithms for soft decision decoding of binary linear codes (Q3346221) (← links)
- Decoding by local optimization (Corresp.) (Q3657906) (← links)
- A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm (Q3713995) (← links)
- Network Reliability Evaluation Using Probability Expressions (Q3721562) (← links)
- An efficient class of unidirectional error detecting/correcting codes (Q3791085) (← links)
- Iteratively maximum likelihood decodable spherical codes and a method for their construction (Q3799953) (← links)
- (Q3864421) (← links)
- Dual-Mode Logic for Function-Independent Fault Testing (Q3893850) (← links)
- Application of information theory to the construction of efficient decision trees (Q3942413) (← links)
- Application of Information Theory to Sequential Fault Diagnosis (Q3967481) (← links)
- Weight distributions of some classes of binary cyclic codes (Corresp.) (Q4060860) (← links)
- Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.) (Q4063324) (← links)
- On the structure of generalized finite-geometry codes (Q4070734) (← links)
- Majority decoding of some classes of binary cyclic codes (Q4074797) (← links)
- Some results on the weight structure of cyclic codes of composite length (Q4093314) (← links)
- An optimum symbol-by-symbol decoding rule for linear codes (Q4103435) (← links)
- An Algorithm for Testing Random Access Memories (Q4132153) (← links)
- Asymptotic performance of optimum bit-by-bit decoding for the white Gaussian channel (Corresp.) (Q4135372) (← links)
- Some results on arithmetic codes of composite length (Q4149655) (← links)
- Algebraic analog decoding of linear binary codes (Q4198627) (← links)
- Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes (Q4307363) (← links)
- The zero-guards algorithm for general minimum-distance decoding problems (Q4371917) (← links)
- Decoding linear block codes using a priority-first search: performance analysis and suboptimal version (Q4400346) (← links)
- Decoding by sequential code reduction (Q4401321) (← links)
- (Q4404128) (← links)
- Efficient heuristic search algorithms for soft-decision decoding of linear block codes (Q4701228) (← links)
- On some classes of cyclic codes of composite length (Corresp.) (Q5181620) (← links)
- A note on t-EC/d-UED codes (Q5375399) (← links)
- On the minimum distance of certain reversible cyclic codes (Corresp.) (Q5598075) (← links)
- A note on the decoding of double-error-correcting binary BCH codes of primitive length (Corresp.) (Q5630975) (← links)
- A bound for cyclic codes of composite length (Corresp.) (Q5633890) (← links)
- A note on the minimum distance structure of cyclic codes (Corresp.) (Q5638197) (← links)
- Decoding beyond the BCH bound (Corresp.) (Q5650277) (← links)
- Generalizations of the BCH bound (Q5652536) (← links)
- Some results on the minimum distance structure of cyclic codes (Q5652537) (← links)
