Остановите войну!
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 138 matches
- 1979
- Matti J. Aaltonen:
Linear programming bounds for tree codes (Corresp.). IEEE Trans. Inf. Theory 25(1): 85-90 (1979) - Hüseyin Abut, N. Erodol:
Bounds on R1 (D) functions for speech probability models (Corresp.). IEEE Trans. Inf. Theory 25(2): 225-228 (1979) - Emad K. Al-Hussaini, L. F. Turner:
The asymptotic performance of two-sample nonparametric detectors when detecting nonfluctuating signals in non-Gaussian noise (Corresp.). IEEE Trans. Inf. Theory 25(1): 124-127 (1979) - Dimitris Anastassiou, David J. Sakrison:
New bounds to R(D) for additive sources and applications to image encoding. IEEE Trans. Inf. Theory 25(2): 145-155 (1979) - Tamer Basar:
Performance Bounds and Optimal Linear Coding for Multichannel Communication Systems (Ph.D. Thesis abstr.). IEEE Trans. Inf. Theory 25(2): 257 (1979) - Tangül Ü. Basar, Tamer Basar:
Optimum linear coding in continuous-time communication systems with noisy side information at the decoder (Corresp.). IEEE Trans. Inf. Theory 25(5): 612-616 (1979) - Gerard Battail, Martine Decouvelaere, Philippe Godlewski:
Replication decoding. IEEE Trans. Inf. Theory 25(3): 332-345 (1979) - Leonard D. Baumert, Robert J. McEliece, Henk C. A. van Tilborg:
Symbol synchronization in convolutionally coded systems (Corresp.). IEEE Trans. Inf. Theory 25(3): 362-365 (1979) - R. Benzel:
The capacity region of a class of discrete additive degraded interference channels (Corresp.). IEEE Trans. Inf. Theory 25(2): 228-231 (1979) - 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) - Monika Bierbaum, Hans-Martin Wallmeier:
A note on the capacity region of the multiple-access channel (Corresp.). IEEE Trans. Inf. Theory 25(4): 484 (1979) - Jacob Binia:
On the capacity of certain additive non-Gaussian channels. IEEE Trans. Inf. Theory 25(4): 448-452 (1979) - Nelson M. Blachman:
The output signals and noise from a nonlinearity with amplitude-dependent phase shift. IEEE Trans. Inf. Theory 25(1): 77-79 (1979) - Mario A. Blanco, Francis S. Hill Jr.:
On time warping and the random delay channel. IEEE Trans. Inf. Theory 25(2): 155-166 (1979) - Rolf J. Blom:
Sounds on key equivocation for simple substitution ciphers. IEEE Trans. Inf. Theory 25(1): 8-18 (1979) - Gilles Brassard:
A note on the complexity of cryptography (Corresp.). IEEE Trans. Inf. Theory 25(2): 232-233 (1979) - Thomas A. Brown, Jack Koplowitz:
The weighted nearest neighbor rule for class dependent sample sizes (Corresp.). IEEE Trans. Inf. Theory 25(5): 617-619 (1979) - James A. Bucklew, Neal C. Gallagher Jr.:
A note on optimal quantization (Corresp.). IEEE Trans. Inf. Theory 25(3): 365-366 (1979) - James A. Bucklew, Neal C. Gallagher Jr.:
Quantization schemes for bivariate Gaussian random variables. IEEE Trans. Inf. Theory 25(5): 537-543 (1979) - James A. Bucklew, Neal C. Gallagher Jr.:
Two-dimensional quantization of bivariate circularly symmetric densities. IEEE Trans. Inf. Theory 25(6): 667-671 (1979) - J. Bibb Cain, George C. Clark Jr., John M. Geist:
Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding (Corresp.). IEEE Trans. Inf. Theory 25(1): 97-100 (1979) - John Capetanakis:
Tree algorithms for packet broadcast channels. IEEE Trans. Inf. Theory 25(5): 505-515 (1979) - Renato M. Capocelli:
A note on uniquely decipherable codes (Corresp.). IEEE Trans. Inf. Theory 25(1): 90-94 (1979) - Shih-Chun Chang:
Coding for a T-User Multiple-Access Channel (Ph.D. Thesis abstr.). IEEE Trans. Inf. Theory 25(2): 257 (1979) - Shih-Chun Chang, Edward J. Weldon Jr.:
Coding for T-user multiple-access channels. IEEE Trans. Inf. Theory 25(6): 684-691 (1979) - John H. Conway, Vera Pless, Neil J. A. Sloane:
Self-dual codes over GF(3) and GF(4) of length not exceeding 16. IEEE Trans. Inf. Theory 25(3): 312-322 (1979) - Thomas M. Cover, Abbas El Gamal:
Capacity theorems for the relay channel. IEEE Trans. Inf. Theory 25(5): 572-584 (1979) - Alain Crolotte, Judea Pearl:
Asymptotic rate-distortion functions for coding precedence relations (Corresp.). IEEE Trans. Inf. Theory 25(1): 80-82 (1979) - Alain Crolotte, Judea Pearl:
Bounds on memory versus error trade-offs in question-answering systems. IEEE Trans. Inf. Theory 25(2): 193-202 (1979) - Alain Crolotte, Judea Pearl:
Elasticity conditions for storage versus error exchange in question-Answering systems. IEEE Trans. Inf. Theory 25(6): 653-664 (1979)
skipping 108 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-27 22:32 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