- CSB - MetaPress - Google - Bing - Yahoo
 | 2007 | |
|---|---|---|
| i1 |      | Po-Ning Chen, Yunghsiang S. Han, Carlos R. P. Hartmann, Hong-Bin Wu: Analysis of Sequential Decoding Complexity Using the Berry-Esseen Inequality. CoRR abs/cs/0701026 (2007) |
| 1998 | ||
| j25 | | 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 Transactions on Information Theory 44(3): 1233-1246 (1998) |
| j24 | | 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 Transactions on Information Theory 44(7): 3023-3038 (1998) |
| 1997 | ||
| j23 | | Yunghsiang S. Han, Carlos R. P. Hartmann: The zero-guards algorithm for general minimum-distance decoding problems. IEEE Transactions on Information Theory 43(5): 1655-1658 (1997) |
| 1996 | ||
| j22 | | D. L. Tao, Carlos R. P. Hartmann, Yunghsing S. (Sam) Han: New Encoding/Decoding Methods for Designing Fault-Tolerant Matrix Operations. IEEE Trans. Parallel Distrib. Syst. 7(9): 931-938 (1996) |
| 1995 | ||
| j21 | | Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney: Parallel Integer Sorting Using Small Operations. Acta Inf. 32(1): 79-92 (1995) |
| 1993 | ||
| j20 | | 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): 31-36 (1993) |
| j19 | | Yunghsiang S. Han, Carlos R. P. Hartmann, Chih-Chieh Chen: Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes. IEEE Transactions on Information Theory 39(5): 1514-1523 (1993) |
| j18 | | D. L. Tao, Carlos R. P. Hartmann: A Novel Concurrent Error Detection Scheme for FFT Networks. IEEE Trans. Parallel Distrib. Syst. 4(2): 198-221 (1993) |
| c5 |  | Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney: Towards Optimal Parallel Radix Sorting. IPPS 1993: 193-197 |
| 1992 | ||
| j17 | | Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney: PRAMs with Variable Word-Size. Inf. Process. Lett. 42(4): 217-222 (1992) |
| j16 | | 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): 881-886 (1992) |
| 1991 | ||
| j15 | | Warren H. Debany Jr., Carlos R. P. Hartmann: Bounds on the sizes of irredundant test sets and sequences for combinational logic networks. J. Electronic Testing 2(4): 325-338 (1991) |
| j14 | | D. L. Tao, Carlos R. P. Hartmann, Parag K. Lala: A Note on t-EC/d-UED Codes. IEEE Trans. Computers 40(5): 660-663 (1991) |
| c4 | | Warren H. Debany Jr., Carlos R. P. Hartmann, Pramod K. Varshney, Kishan G. Mehrotra: Comparison of Random Test Vector Generation Strategies. ICCAD 1991: 244-247 |
| c3 | | D. L. Tao, Eugene Foo, Carlos R. P. Hartmann: A new algorithm-based fault tolerance technique for computing matrix operations. SPDP 1991: 452-455 |
| 1990 | ||
| c2 | | D. L. Tao, Carlos R. P. Hartmann, Y. S. Chen: A novel concurrent error detection scheme for FFT networks. FTCS 1990: 114-121 |
| 1988 | ||
| j13 | | Jiapeng Gao, Luther D. Rudolph, Carlos R. P. Hartmann: Iteratively maximum likelihood decodable spherical codes and a method for their construction. IEEE Transactions on Information Theory 34(3): 480-485 (1988) |
| 1986 | ||
| c1 | | D. L. Tao, Carlos R. P. Hartmann, Parag K. Lala: A Concurrent Testing Strategy for PLAs. ITC 1986: 705-709 |
| 1985 | ||
| j12 | | Lev B. Levitin, Carlos R. P. Hartmann: A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm. IEEE Transactions on Information Theory 31(3): 378-384 (1985) |
| 1984 | ||
| j11 | | Pramod K. Varshney, Carlos R. P. Hartmann: Sequential Fault Diagnosis of Modular Systems. IEEE Trans. Computers 33(2): 194-197 (1984) |
| j10 | | Nandakumar N. Tendolkar, Carlos R. P. Hartmann: Generalization of chase algorithms for soft decision decoding of binary linear codes. IEEE Transactions on Information Theory 30(5): 714-721 (1984) |
| 1983 | ||
| j9 | | K. H. Farrell, Luther D. Rudolph, Carlos R. P. Hartmann, L. D. Nielsen: Decoding by local optimization. IEEE Transactions on Information Theory 29(5): 740-743 (1983) |
| 1982 | ||
| j8 | | 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): 164-170 (1982) |
| j7 | | 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 Transactions on Information Theory 28(4): 565-577 (1982) |
| 1980 | ||
| j6 | | Sumit Dasgupta, Carlos R. P. Hartmann, Luther D. Rudolph: Dual-Mode Logic for Function-Independent Fault Testing. IEEE Trans. Computers 29(11): 1025-1029 (1980) |
| 1977 | ||
| j5 | | John Knaizuk Jr., Carlos R. P. Hartmann: An Algorithm for Testing Random Access Memories. IEEE Trans. Computers 26(4): 414-416 (1977) |
| j4 | | John Knaizuk Jr., Carlos R. P. Hartmann: An Optimal Algorithm for Testing Stuck-at Faults in Random Access Memories. IEEE Trans. Computers 26(11): 1141-1144 (1977) |
| 1976 | ||
| j3 | | Carlos R. P. Hartmann, Tai-Yang Hwang: Some results on the weight structure of cyclic codes of composite length. IEEE Transactions on Information Theory 22(3): 340-348 (1976) |
| j2 | | Carlos R. P. Hartmann, Luther D. Rudolph: An optimum symbol-by-symbol decoding rule for linear codes. IEEE Transactions on Information Theory 22(5): 514-517 (1976) |
| 1972 | ||
| j1 | | Carlos R. P. Hartmann, K. K. Tzeng: Generalizations of the BCH Bound. Information and Control 20(5): 489-498 (1972) |
Colors in the list of coauthors
Last update Tue May 21 19:52:10 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page