Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 85 matches
- 1964
- Joseph M. Aein:
Correction to 'Reducing the Effect of Intersymbol Interference with Correlation receivers'. IEEE Trans. Inf. Theory 10(1): 91 (1964) - R. Albrecht, W. Werner:
Error analysis of a statistical decision method. IEEE Trans. Inf. Theory 10(1): 34-38 (1964) - A. V. Balakrishnan:
On a class of nonlinear estimation problems. IEEE Trans. Inf. Theory 10(4): 314-320 (1964) - Ranan B. Banerji:
An extension of the Kraft inequality (Corresp.). IEEE Trans. Inf. Theory 10(4): 387-388 (1964) - E. D. Banta:
A note on the correlation function of nonindependent, overlapping pulse trains. IEEE Trans. Inf. Theory 10(2): 160-161 (1964) - Phillip A. Bello:
Time-frequency duality. IEEE Trans. Inf. Theory 10(1): 18-33 (1964) - Phillip A. Bello:
On the measurement of a channel correlation function (Corresp.). IEEE Trans. Inf. Theory 10(4): 381-383 (1964) - C. Berglund:
A note on power-law devices and their effect on signal-to-noise ratio. IEEE Trans. Inf. Theory 10(1): 52-57 (1964) - Elwyn R. Berlekamp:
Note on recurrent codes (Corresp.). IEEE Trans. Inf. Theory 10(3): 257-258 (1964) - Neil J. Bershad:
On the optimum design of multipath signals (Corresp.). IEEE Trans. Inf. Theory 10(4): 389-390 (1964) - Nelson M. Blachman:
Band-pass nonlinearities. IEEE Trans. Inf. Theory 10(2): 162-164 (1964) - Nelson M. Blachman:
FM reception and the zeros of narrow-band Gaussian noise. IEEE Trans. Inf. Theory 10(3): 235-241 (1964) - Leo I. Bluestein:
Asymptotically optimum quantizers and optimum analog to digital converters for continuous signals (Corresp.). IEEE Trans. Inf. Theory 10(3): 242-246 (1964) - Lorenzo Calabi, Eric R. Myrvaagnes:
On the minimal weight of binary group codes (Corresp.). IEEE Trans. Inf. Theory 10(4): 385-387 (1964) - L. Lorne Campbell:
On a class of polynomials useful in probability calculations (Corresp.). IEEE Trans. Inf. Theory 10(3): 255-256 (1964) - Jack Capon:
Optimum weighting functions for the detection of sampled signals in noise. IEEE Trans. Inf. Theory 10(2): 152-159 (1964) - Jack W. Carlyle, John B. Thomas:
On nonparametric signal detectors. IEEE Trans. Inf. Theory 10(2): 146-152 (1964) - Ting T. Chang, John G. Lawton:
On the comparison of communication channels (Corresp.). IEEE Trans. Inf. Theory 10(1): 97-98 (1964) - Robert T. Chien:
On linear residue codes for burst-error correction. IEEE Trans. Inf. Theory 10(2): 127-133 (1964) - Robert T. Chien:
Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes. IEEE Trans. Inf. Theory 10(4): 357-363 (1964) - Robert D'Attilio:
Boothroyd and intersymbol interference reduction (Corresp.). IEEE Trans. Inf. Theory 10(3): 257 (1964) - Peter M. Dollard:
On the time-bandwidth concentration of signal functions forming given geometric vector configurations. IEEE Trans. Inf. Theory 10(4): 328-338 (1964) - Worthie Doyle, Irving S. Reed:
Approximate band-pass limiter envelope distributions. IEEE Trans. Inf. Theory 10(3): 180-185 (1964) - Willard L. Eastman, Shimon Even:
On synchronizable and PSK-synchronizable block codes. IEEE Trans. Inf. Theory 10(4): 351-356 (1964) - Shimon Even:
Test for synchronizability of finite automata and variable length codes. IEEE Trans. Inf. Theory 10(3): 185-189 (1964) - Terrence L. Fine:
Properties of an optimum digital system and applications. IEEE Trans. Inf. Theory 10(4): 287-296 (1964) - William B. Floyd:
Review of 'Information Theory and Coding' (Abramson, N.; 1963). IEEE Trans. Inf. Theory 10(4): 392 (1964) - E. N. Fowle:
The design of FM pulse compression signals. IEEE Trans. Inf. Theory 10(1): 61-67 (1964) - Wade H. Foy:
Entropy of simple line drawings (Corresp.). IEEE Trans. Inf. Theory 10(2): 165-167 (1964) - Charles V. Freiman:
Upper bounds for fixed-weight codes of specified minimum distance (Corresp.). IEEE Trans. Inf. Theory 10(3): 246-248 (1964)
skipping 55 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-30 06:55 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint