Остановите войну!
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 160 matches
- 1971
- Nikitas A. Alexandridis:
Relations among sequency, axis symmetry, and period of Walsh functions (Corresp.). IEEE Trans. Inf. Theory 17(4): 495-497 (1971) - Richard A. Altes:
Suppression of radar clutter and multipath effects for wide-band signals (Corresp.). IEEE Trans. Inf. Theory 17(3): 344-346 (1971) - Harry C. Andrews:
Bibliography on rate distortion theory (Corresp.). IEEE Trans. Inf. Theory 17(2): 198-199 (1971) - Albert Arcese, E. W. Trombini:
Variances of spectral parameters with a Gaussian shape (Corresp.). IEEE Trans. Inf. Theory 17(2): 200-201 (1971) - Lalit R. Bahl, Robert T. Chien:
Single- and multiple-burst-correcting properties of a class of cyclic product codes. IEEE Trans. Inf. Theory 17(5): 594-600 (1971) - Lalit R. Bahl, Frederick Jelinek:
Rate 1/2 convolutional codes with complementary generators. IEEE Trans. Inf. Theory 17(6): 718-727 (1971) - F. Bechtel, W. Gavin, G. R. Bachand:
Geometric interpretation of admissible linear decision boundaries for two multivariate normal distributions (Corresp.). IEEE Trans. Inf. Theory 17(6): 755-758 (1971) - Michael P. Beddoes, Otto Meier:
Correction to 'Flicker effect and television compression'. IEEE Trans. Inf. Theory 17(1): 119 (1971) - Toby Berger:
The source coding game. IEEE Trans. Inf. Theory 17(1): 71-76 (1971) - Neil J. Bershad, Jack Sklansky:
Threshold learning and Brownian motion (Corresp.). IEEE Trans. Inf. Theory 17(3): 350-352 (1971) - Nelson M. Blachman:
Detectors, bandpass nonlinearities, and their optimization: Inversion of the Chebyshev transform. IEEE Trans. Inf. Theory 17(4): 398-404 (1971) - L. S. Bobrow:
Decoding augmented cutset codes (Corresp.). IEEE Trans. Inf. Theory 17(2): 218-220 (1971) - L. S. Bobrow, S. Louis Hakimi:
Graph theoretic q -ary codes (Corresp.). IEEE Trans. Inf. Theory 17(2): 215-218 (1971) - Adriaan van den Bos:
Alternative interpretation of maximum entropy spectral analysis (Corresp.). IEEE Trans. Inf. Theory 17(4): 493-494 (1971) - S. Bradley:
Coding the binary symmetric source with a fidelity criterion (Corresp.). IEEE Trans. Inf. Theory 17(6): 749-751 (1971) - Lane H. Brandenburg, H. E. Meadows:
Shaping filter representation of nonstationary colored noise. IEEE Trans. Inf. Theory 17(1): 26-31 (1971) - Barry J. Bunin, Jack K. Wolf:
Convergence to the rate-distortion function for Gaussian sources. IEEE Trans. Inf. Theory 17(1): 65-70 (1971) - Herbert O. Burton:
Some asymptotically optimal burst-correcting codes and their relation to single-error-correcting Reed-Solomon codes. IEEE Trans. Inf. Theory 17(1): 92-95 (1971) - Herbert O. Burton:
Inversionless decoding of binary BCH codes. IEEE Trans. Inf. Theory 17(4): 464-466 (1971) - Herbert O. Burton, Daniel D. Sullivan, Shih-Yung Tong:
Generalized burst-trapping codes. IEEE Trans. Inf. Theory 17(6): 736-742 (1971) - Stanley A. Butman:
Rate distortion over band-limited feedback channels (Corresp.). IEEE Trans. Inf. Theory 17(1): 110-112 (1971) - Charles R. Cahn:
Worst interference for coherent binary channel (Corresp.). IEEE Trans. Inf. Theory 17(2): 209-210 (1971) - Stamatis Cambanis, Bede Liu:
On the expansion of a bivariate distribution and its relationship to the output of a nolinearity. IEEE Trans. Inf. Theory 17(1): 17-25 (1971) - B. Chandrasekaran:
Reply to 'Finite memory hypothesis testing-Comments on a critique' by Cover, T. M., and Hellman, M. E. IEEE Trans. Inf. Theory 17(1): 104-105 (1971) - B. Chandrasekaran:
Independence of measurements and the mean recognition accuracy. IEEE Trans. Inf. Theory 17(4): 452-456 (1971) - Chin-Long Chen:
On majority-logic decoding of finite geometry codes. IEEE Trans. Inf. Theory 17(3): 332-336 (1971) - Yau-Chau Ching, Ludwik Kurz:
Lower bounds in the capacity of permutation channels. IEEE Trans. Inf. Theory 17(2): 134-140 (1971) - C. K. Chow:
Comments on 'Note on a partition for a decision feedback strategy' by Lavenberg, S.S. IEEE Trans. Inf. Theory 17(2): 210-211 (1971) - Joseph Peter Costello:
On the number of points in regular discrete simplex (Corresp.). IEEE Trans. Inf. Theory 17(2): 211-212 (1971) - Daniel J. Costello Jr., Thomas N. Morrissey Jr.:
Strengthened lower bound on definite decoding minimum distance for periodic convolutional codes (Corresp.). IEEE Trans. Inf. Theory 17(2): 212-214 (1971)
skipping 130 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-09-06 18:29 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