default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJim K. Omura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1991
[j26]Jack T. Taylor, Jim K. Omura:
Spread spectrum technology: a solution to the personal communications services frequency allocation dilemma. IEEE Commun. Mag. 29(2): 48-51 (1991)- 1990
- [j25]Jim K. Omura:
Novel applications of cryptography in digital communications. IEEE Commun. Mag. 28(5): 21-29 (1990) - [j24]Michael J. Sabin, Jim K. Omura, Leslie Nightingill:
A T1 ones-density controller based on finite-state machines. IEEE Trans. Commun. 38(6): 906-914 (1990)
1980 – 1989
- 1988
- [j23]Ramin Sadr, Jim K. Omura:
Generalized minimum shift-keying modulation techniques. IEEE Trans. Commun. 36(1): 32-40 (1988) - 1987
- [j22]Jim K. Omura:
A computer dial access system based on public-key techniques. IEEE Commun. Mag. 25(7): 73-79 (1987) - [j21]David B. Newman Jr., Jim K. Omura, Raymond L. Pickholtz:
Public key management for network security. IEEE Netw. 1(2): 11-16 (1987) - 1986
- [j20]Din Y. Pei, Charles C. Wang, Jim K. Omura:
Normal basis of finite field GF(2m). IEEE Trans. Inf. Theory 32(2): 285-287 (1986) - [c1]Jim K. Omura, S. J. Moon:
Low cost voice compression for mobile digital radios. ICASSP 1986: 2371-2374 - 1985
- [j19]Charles C. Wang, Trieu-Kien Truong, Howard M. Shao, Leslie J. Deutsch, Jim K. Omura, Irving S. Reed:
VLSI Architectures for Computing Multiplications and Inverses in GF(2m). IEEE Trans. Computers 34(8): 709-717 (1985) - 1983
- [j18]Tong L. Lim, Jim K. Omura:
Error Rate Estimates in Digital Communication Over a Nonlinear Channel with Memory. IEEE Trans. Commun. 31(3): 407-412 (1983) - 1982
- [j17]Jim K. Omura, Barry K. Levitt:
Coded Error Probability Evaluation for Antijam Communication Systems. IEEE Trans. Commun. 30(5): 896-903 (1982) - 1981
- [j16]Tsou-Chiang Huang, Jim K. Omura, William C. Lindsey:
Analysis of Coherent Satellite Communication Systems in the Presence of Interference and Noise. IEEE Trans. Commun. 29(5): 593-604 (1981) - [j15]Leon Biederman, Jim K. Omura, Pravin C. Jain:
Decoding with approximate channel statistics for bandlimited nonlinear satellite channels. IEEE Trans. Inf. Theory 27(6): 697-707 (1981) - 1980
- [j14]Tsou-Chiang Huang, Jim K. Omura, Leon Biederman:
Bit Error Rate Comparison of Repeater and Regenerative Communication Satellites. IEEE Trans. Commun. 28(7): 1088-1097 (1980)
1970 – 1979
- 1979
- [j13]Toby Berger, Kim B. Housewright, Jim K. Omura, Suiyin Yung, Jacob Wolfowitz:
An upper bound on the rate distortion function for source coding with partial side information at the decoder. IEEE Trans. Inf. Theory 25(6): 664-666 (1979) - 1977
- [j12]Robert J. McEliece, Jim K. Omura:
An improved upper bound on the block coding error exponent for binary-input discrete memoryless channels (Corresp.). IEEE Trans. Inf. Theory 23(5): 611-613 (1977) - 1975
- [j11]Jim K. Omura:
A Lower Bounding Method for Channel and Source Coding Probabilities. Inf. Control. 27(2): 148-177 (1975) - [j10]Robert M. Gray, David L. Neuhoff, Jim K. Omura:
Process definitions of distortion-rate functions and source coding theorems. IEEE Trans. Inf. Theory 21(5): 524-532 (1975) - 1974
- [j9]Jim K. Omura:
Expurgated Bounds, Bhattacharyya Distance, and Rate Distortion Functions. Inf. Control. 24(4): 358-383 (1974) - [j8]Andrew J. Viterbi, Jim K. Omura:
Trellis Encoding of memoryless discrete-time sources with a fidelity criterion. IEEE Trans. Inf. Theory 20(3): 325-332 (1974) - 1973
- [j7]Jim K. Omura:
A coding theorem for discrete-time sources. IEEE Trans. Inf. Theory 19(4): 490-498 (1973) - [j6]Jim K. Omura, A. Shohara:
On convergence of distortion for block and tree encoding of symmetric sources (Corresp.). IEEE Trans. Inf. Theory 19(4): 573-577 (1973) - [j5]Jim K. Omura:
On general Gilbert bounds. IEEE Trans. Inf. Theory 19(5): 661-666 (1973) - 1972
- [j4]Jim K. Omura:
Iterative decoding of linear codes by a modulo-2 linear program. Discret. Math. 3(1-3): 193-208 (1972) - 1971
- [j3]Jim K. Omura:
Optimal receiver design for convolutional codes and channels with memory via control theoretical concepts. Inf. Sci. 3(3): 243-266 (1971)
1960 – 1969
- 1969
- [j2]Jim K. Omura:
On the Viterbi decoding algorithm. IEEE Trans. Inf. Theory 15(1): 177-179 (1969) - 1968
- [j1]Jim K. Omura:
Optimum linear transmission of analog data for channels with feedback. IEEE Trans. Inf. Theory 14(1): 38-43 (1968)
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-04-24 23:19 CEST 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:
