Остановите войну!
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 196 matches
- 1988
- Khaled A. S. Abdel-Ghaffar:
On the existence of optimum cyclic burst correcting codes over GF(q). IEEE Trans. Inf. Theory 34(2): 329-332 (1988) - Khaled A. S. Abdel-Ghaffar, Robert J. McEliece, Henk C. A. van Tilborg:
Two-dimensional burst identification codes and their use in burst correction. IEEE Trans. Inf. Theory 34(3): 494-504 (1988) - Jean-Pierre Adoul, Michel Barth:
Nearest neighbor algorithm for spherical codes from the Leech lattice. IEEE Trans. Inf. Theory 34(5): 1188-1202 (1988) - Noga Alon, Ernest E. Bergmann, Don Coppersmith, Andrew M. Odlyzko:
Balancing sets of vectors. IEEE Trans. Inf. Theory 34(1): 128-130 (1988) - Hamid R. Amirazizi, Martin E. Hellman:
Time-memory-processor trade-offs. IEEE Trans. Inf. Theory 34(3): 505-512 (1988) - Gonzalo R. Arce, Neal C. Gallagher Jr.:
Stochastic analysis for the recursive median filter process. IEEE Trans. Inf. Theory 34(4): 669-679 (1988) - Erdal Arikan:
An upper bound on the cutoff rate of sequential decoding. IEEE Trans. Inf. Theory 34(1): 55-63 (1988) - Erdal Arikan:
Sequential decoding for multiple access channels. IEEE Trans. Inf. Theory 34(2): 246-259 (1988) - Jonathan J. Ashley:
A linear bound for sliding-block decoder window size. IEEE Trans. Inf. Theory 34(3): 389-399 (1988) - Randall K. Bahr, James A. Bucklew:
Minimax estimation of unknown deterministic signals in colored noise. IEEE Trans. Inf. Theory 34(4): 632-641 (1988) - Pierre Baldi:
Neural networks, orientations of the hypercube, and algebraic threshold functions. IEEE Trans. Inf. Theory 34(3): 523-530 (1988) - Israel Bar-David, Shlomo Shamai:
On information transfer by envelope-constrained signals over the AWGN channel. IEEE Trans. Inf. Theory 34(3): 371-379 (1988) - Israel Bar-David, Shlomo Shamai:
On the Rice model of noise in FM receivers. IEEE Trans. Inf. Theory 34(6): 1406-1419 (1988) - Andrew R. Barron, Thomas M. Cover:
A bound on the financial value of information. IEEE Trans. Inf. Theory 34(5): 1097-1100 (1988) - Richard J. Barton, H. Vincent Poor:
Signal detection in fractional Gaussian noise. IEEE Trans. Inf. Theory 34(5): 943-959 (1988) - Leonid A. Bassalygo, Roland L. Dobrushin, Mark S. Pinsker:
Kolmogorov remembered. IEEE Trans. Inf. Theory 34(2): 174-175 (1988) - Edward Bedrosian:
Amplitude demodulation of filtered AM/PM signals. IEEE Trans. Inf. Theory 34(6): 1472-1482 (1988) - Sergio Benedetto, Marco Ajmone Marsan, Guido Albertengo, Egidio P. Giachin:
Combined coding and modulation: Theory and applications. IEEE Trans. Inf. Theory 34(2): 223-236 (1988) - Toby Berger:
Andrei Nikolaevich Kolmogorov (April 25, 1903-October 20, 1987). IEEE Trans. Inf. Theory 34(2): 173 (1988) - Toby Berger:
Preface to special issue on coding techniques and coding theory. IEEE Trans. Inf. Theory 34(5): 1121 (1988) - Ezio Biglieri, Michele Elia:
Multidimensional modulation and coding for band-limited digital channels. IEEE Trans. Inf. Theory 34(4): 803-809 (1988) - Nelson M. Blachman:
Gaussian noise-I: The shape of large excursions. IEEE Trans. Inf. Theory 34(6): 1396-1400 (1988) - Nelson M. Blachman:
Gaussian noise-II: Distribution of phase change of narrow-band noise plus sinusoid. IEEE Trans. Inf. Theory 34(6): 1401-1405 (1988) - Mario Blaum:
A (16, 9, 6, 5, 4) error-correcting DC free block code. IEEE Trans. Inf. Theory 34(1): 138-141 (1988) - Mario Blaum, Patrick Guy Farrell, Henk C. A. van Tilborg:
Multiple burst-correcting array codes. IEEE Trans. Inf. Theory 34(5): 1061-1066 (1988) - Aart Blokhuis, H. J. Tiersma:
Bounds for the size of radar arrays. IEEE Trans. Inf. Theory 34(1): 164-167 (1988) - Anselm Blumer, Robert J. McEliece:
The Rényi redundancy of generalized Huffman codes. IEEE Trans. Inf. Theory 34(5): 1242-1249 (1988) - Ben-Zion Bobrovsky, Moshe Zakai, Ofer Zeitouni:
Error bounds for the nonlinear filtering of signals with small diffusion coefficients. IEEE Trans. Inf. Theory 34(4): 710-721 (1988) - Jean-Paul Boly, Wil J. van Gils:
Codes for combined symbol and digit error control. IEEE Trans. Inf. Theory 34(5): 1286-1307 (1988) - Pierre Brémaud:
An averaging principle for filtering a jump process with point process observations. IEEE Trans. Inf. Theory 34(3): 582-586 (1988)
skipping 166 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-25 16:51 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