default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarlos R. P. Hartmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 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)
1990 – 1999
- 1998
- [j44]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 Trans. Inf. Theory 44(3): 1233-1246 (1998) - [j43]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 Trans. Inf. Theory 44(7): 3023-3038 (1998) - 1997
- [j42]Yunghsiang S. Han, Carlos R. P. Hartmann:
The zero-guards algorithm for general minimum-distance decoding problems. IEEE Trans. Inf. Theory 43(5): 1655-1658 (1997) - 1996
- [j41]Dali L. Tao, Carlos R. P. Hartmann, Yunghsing S. (Sam) Han:
New Encoding/Decoding Methods for Designing Fault-Tolerant Matrix Operations. IEEE Trans. Parallel Distributed Syst. 7(9): 931-938 (1996) - 1995
- [j40]Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney:
Parallel Integer Sorting Using Small Operations. Acta Informatica 32(1): 79-92 (1995) - 1993
- [j39]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) - [j38]Yunghsiang S. Han, Carlos R. P. Hartmann, Chih-Chieh Chen:
Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes. IEEE Trans. Inf. Theory 39(5): 1514-1523 (1993) - [j37]Dali L. Tao, Carlos R. P. Hartmann:
A Novel Concurrent Error Detection Scheme for FFT Networks. IEEE Trans. Parallel Distributed 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
- [j36]Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney:
PRAMs with Variable Word-Size. Inf. Process. Lett. 42(4): 217-222 (1992) - [j35]Dali 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
- [j34]Warren H. Debany Jr., Carlos R. P. Hartmann:
Bounds on the sizes of irredundant test sets and sequences for combinational logic networks. J. Electron. Test. 2(4): 325-338 (1991) - [j33]Dali 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]Dali 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]Dali L. Tao, Carlos R. P. Hartmann, Y. S. Chen:
A novel concurrent error detection scheme for FFT networks. FTCS 1990: 114-121
1980 – 1989
- 1988
- [j32]Dali L. Tao, Parag K. Lala, Carlos R. P. Hartmann:
A MOS implementation of totally self-checking checker for the 1-out-of-3 code. IEEE J. Solid State Circuits 23(3): 875-877 (1988) - [j31]Dali L. Tao, Carlos R. P. Hartmann, Parag K. Lala:
An efficient class of unidirectional error detecting/correcting codes. IEEE Trans. Computers 37(6): 879-882 (1988) - [j30]Jiapeng Gao, Luther D. Rudolph, Carlos R. P. Hartmann:
Iteratively maximum likelihood decodable spherical codes and a method for their construction. IEEE Trans. Inf. Theory 34(3): 480-485 (1988) - 1986
- [c1]Dali L. Tao, Carlos R. P. Hartmann, Parag K. Lala:
A Concurrent Testing Strategy for PLAs. ITC 1986: 705-709 - 1985
- [j29]Lev B. Levitin, Carlos R. P. Hartmann:
A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm. IEEE Trans. Inf. Theory 31(3): 378-384 (1985) - 1984
- [j28]Pramod K. Varshney, Carlos R. P. Hartmann:
Sequential Fault Diagnosis of Modular Systems. IEEE Trans. Computers 33(2): 194-197 (1984) - [j27]Nandakumar N. Tendolkar, Carlos R. P. Hartmann:
Generalization of chase algorithms for soft decision decoding of binary linear codes. IEEE Trans. Inf. Theory 30(5): 714-721 (1984) - 1983
- [j26]K. H. Farrell, Luther D. Rudolph, Carlos R. P. Hartmann, L. D. Nielsen:
Decoding by local optimization. IEEE Trans. Inf. Theory 29(5): 740-743 (1983) - 1982
- [j25]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) - [j24]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 Trans. Inf. Theory 28(4): 565-577 (1982) - 1980
- [j23]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)
1970 – 1979
- 1979
- [j22]Luther D. Rudolph, Carlos R. P. Hartmann, Tai-Yang Hwang, Nguyen Duc:
Algebraic analog decoding of linear binary codes. IEEE Trans. Inf. Theory 25(4): 430-440 (1979) - 1978
- [j21]Tai-Yang Hwang, Carlos R. P. Hartmann:
Some results on arithmetic codes of composite length. IEEE Trans. Inf. Theory 24(1): 93-99 (1978) - 1977
- [j20]John Knaizuk Jr., Carlos R. P. Hartmann:
An Algorithm for Testing Random Access Memories. IEEE Trans. Computers 26(4): 414-416 (1977) - [j19]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) - [j18]Carlos R. P. Hartmann, Luther D. Rudolph, Kishan G. Mehrotra:
Asymptotic performance of optimum bit-by-bit decoding for the white Gaussian channel (Corresp.). IEEE Trans. Inf. Theory 23(4): 520-522 (1977) - 1976
- [j17]Carlos R. P. Hartmann, Tai-Yang Hwang:
Some results on the weight structure of cyclic codes of composite length. IEEE Trans. Inf. Theory 22(3): 340-348 (1976) - [j16]Carlos R. P. Hartmann, Luther D. Rudolph:
An optimum symbol-by-symbol decoding rule for linear codes. IEEE Trans. Inf. Theory 22(5): 514-517 (1976) - 1975
- [j15]Carlos R. P. Hartmann, Ralph J. Longobardi:
Weight distributions of some classes of binary cyclic codes (Corresp.). IEEE Trans. Inf. Theory 21(3): 345-350 (1975) - [j14]Tai-Yang Hwang, Carlos R. P. Hartmann:
Correction to a proof in the coding literature (Corresp.). IEEE Trans. Inf. Theory 21(3): 351 (1975) - 1974
- [j13]Carlos R. P. Hartmann, James B. Ducey, Luther D. Rudolph:
On the structure of generalized finite-geometry codes. IEEE Trans. Inf. Theory 20(2): 240-252 (1974) - [j12]Carlos R. P. Hartmann, Kenneth K. Tzeng:
Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.). IEEE Trans. Inf. Theory 20(2): 292-295 (1974) - [j11]J. R. Riek, Carlos R. P. Hartmann, Luther D. Rudolph:
Majority decoding of some classes of binary cyclic codes. IEEE Trans. Inf. Theory 20(5): 637-643 (1974) - 1973
- [j10]Luther D. Rudolph, Carlos R. P. Hartmann:
Decoding by sequential code reduction. IEEE Trans. Inf. Theory 19(4): 549-555 (1973) - [j9]Carlos R. P. Hartmann, Kenneth K. Tzeng:
On some classes of cyclic codes of composite length (Corresp.). IEEE Trans. Inf. Theory 19(6): 820-823 (1973) - 1972
- [j8]Carlos R. P. Hartmann, Kenneth K. Tzeng:
Generalizations of the BCH Bound. Inf. Control. 20(5): 489-498 (1972) - [j7]Carlos R. P. Hartmann, Kenneth K. Tzeng:
A bound for cyclic codes of composite length (Corresp.). IEEE Trans. Inf. Theory 18(2): 307 (1972) - [j6]Carlos R. P. Hartmann, Kenneth K. Tzeng:
A bound for arithmetic codes of composite length (Corresp.). IEEE Trans. Inf. Theory 18(2): 308 (1972) - [j5]Carlos R. P. Hartmann, Kenneth K. Tzeng, Robert T. Chien:
Some results on the minimum distance structure of cyclic codes. IEEE Trans. Inf. Theory 18(3): 402-409 (1972) - [j4]Carlos R. P. Hartmann:
A note on the minimum distance structure of cyclic codes (Corresp.). IEEE Trans. Inf. Theory 18(3): 439-440 (1972) - [j3]Carlos R. P. Hartmann:
Decoding beyond the BCH bound (Corresp.). IEEE Trans. Inf. Theory 18(3): 441-444 (1972) - 1971
- [j2]Carlos R. P. Hartmann:
A note on the decoding of double-error-correcting binary BCH codes of primitive length (Corresp.). IEEE Trans. Inf. Theory 17(6): 765-766 (1971) - 1970
- [b1]Carlos R. P. Hartmann:
On the Minimum Distance Structure of Cyclic Codes and Decoding Beyond Thebch Bound. University of Illinois Urbana-Champaign, USA, 1970 - [j1]Kenneth K. Tzeng, Carlos R. P. Hartmann:
On the minimum distance of certain reversible cyclic codes (Corresp.). IEEE Trans. Inf. Theory 16(5): 644-646 (1970)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
