default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames George Dunham
Refine list
refinements active!
zoomed in on 24 of 24 records
view refined list in
export refined list as
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access 
- no options
- temporarily not available
2020 – today
- 2023
[c8]Shawn A. Prestridge, James G. Dunham, Dinesh Rajan:
Information-Theoretic Security in BB84 QKD. ITNAC 2023: 297-303- no results
2010 – 2019
- 2017
- [c7]Shawn A. Prestridge, James G. Dunham:
Improving Throughput in BB84 Quantum Key Distribution. SECRYPT 2017: 437-443 - 2016
- [c6]Senwen Kan, Jennifer Dworak, James George Dunham:
Echeloned IJTAG data protection. AsianHOST 2016: 1-6 - 2015
- [c5]Eran Pisek, Shadi Abu-Surra, Rakesh Taori, James G. Dunham, Dinesh Rajan:
Enhanced Cryptcoding: Joint Security and Advanced Dual-Step Quasi-Cyclic LDPC Coding. GLOBECOM 2015: 1-7 - no results
2000 – 2009
- 2005
- [c4]James G. Dunham, Ming-Tan Sun, J. C. R. Tseng:
Classifying file type of stream ciphers in depth using neural networks. AICCSA 2005: 97 - 2002
- [j16]Nermin A. Mohamed, James G. Dunham:
A low-complexity combined antenna array and interference cancellation DS-CDMA receiver in multipath fading channels. IEEE J. Sel. Areas Commun. 20(2): 248-256 (2002) - [j15]Nermin A. Mohamed, James G. Dunham:
A Combined Antenna Array and Multi-User Detection DS-CDMA Receiver in Single-Path and Multi-Path Fading Channels. Wirel. Pers. Commun. 20(3): 251-265 (2002) - no results
1990 – 1999
- 1999
- [c3]Nermin A. Mohamed, James G. Dunham:
A simple combined conjugate gradient beamforming and interference cancellation scheme for DS-CDMA in a multipath fading channel. WCNC 1999: 859-863 - 1993
- [j14]Cheng-Chang Lu, James George Dunham:
Shape matching using polygon approximation and dynamic alignment. Pattern Recognit. Lett. 14(12): 945-949 (1993) - 1992
- [j13]Cheng-Chang Lu, James George Dunham:
A universal model based on minimax average divergence. IEEE Trans. Inf. Theory 38(1): 140-144 (1992) - 1991
- [j12]Cheng-Chang Lu, James George Dunham:
Highly efficient coding schemes for contour lines based on chain code representations. IEEE Trans. Commun. 39(10): 1511-1514 (1991) - 1990
- [c2]Chih-Chwen Chuang, James George Dunham:
Matrix Extensions of the RSA Algorithm. CRYPTO 1990: 140-155 - no results
1980 – 1989
- 1988
- [c1]Cheng-Chang Lu, James George Dunham:
Hierarchical shape recognition using polygon approximation and dynamic alignment. ICASSP 1988: 976-979 - 1987
- [j11]Sharaf E. Elnahas, James George Dunham:
Entropy Coding for Low-Bit-Rate Visual Telecommunications. IEEE J. Sel. Areas Commun. 5(7): 1175-1183 (1987) - 1986
- [j10]James George Dunham:
Optimum Uniform Piecewise Linear Approximation of Planar Curves. IEEE Trans. Pattern Anal. Mach. Intell. 8(1): 67-75 (1986) - [j9]James George Dunham:
Optimal Discrete-Time Delta Modulation System. IEEE Trans. Commun. 34(5): 510-512 (1986) - 1983
- [j8]James G. Dunham, Kou-Hu Tzou:
Performance Bounds for Convolutional Codes with Digital Viterbi Decoders in Gaussian Noise. IEEE Trans. Commun. 31(10): 1124-1132 (1983) - [j7]John C. Kieffer, James George Dunham:
On a type of stochastic stability for a class of encoding schemes. IEEE Trans. Inf. Theory 29(6): 793-797 (1983) - 1981
- [j6]Kou-Hu Tzou, James G. Dunham:
Sliding Block Decoding of Convolutional Codes. IEEE Trans. Commun. 29(9): 1401-1403 (1981) - [j5]James George Dunham, Robert M. Gray:
Joint source and noisy channel trellis encoding. IEEE Trans. Inf. Theory 27(4): 516-519 (1981) - 1980
- [j4]James G. Dunham:
Optimal noiseless coding of random variables (Corresp.). IEEE Trans. Inf. Theory 26(3): 345 (1980) - [j3]James G. Dunham:
Bounds on message equivocation for simple substitution ciphers. IEEE Trans. Inf. Theory 26(5): 522-527 (1980) - no results
1970 – 1979
- 1979
- [j2]James George Dunham:
Abstract Alphabet Distortion-Rate Functions. Inf. Control. 40(2): 181-191 (1979) - 1978
- [j1]James George Dunham:
A note on the abstract alphabet block source coding with a fidelity criterion theorem (Corresp.). IEEE Trans. Inf. Theory 24(6): 760 (1978) - no results
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.
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.
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.
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 2025-01-20 23:00 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:
