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 177 matches
- 1983
- Roy L. Adler, Don Coppersmith, Martin Hassner:
Algorithms for sliding block codes - An application of symbolic dynamics to information theory. IEEE Trans. Inf. Theory 29(1): 5-22 (1983) - Rudolf Ahlswede, Te Sun Han:
On source coding with side information via a multiple-access channel and related problems in multi-user information theory. IEEE Trans. Inf. Theory 29(3): 396-411 (1983) - Sabah A. Al-Quaddoomi:
Two-Dimensional Binary Codes with Good Autocorrelation. IEEE Trans. Inf. Theory 29(6): 943 (1983) - Larry C. Andrews, Clay S. Brice:
The pdf and cdf for the sum of N filtered outputs of an analog cross correlator with bandpass inputs. IEEE Trans. Inf. Theory 29(2): 299-306 (1983) - Albert Arcese:
On the method of maximum entropy spectrum estimation. IEEE Trans. Inf. Theory 29(1): 161-164 (1983) - Charles Asmuth, John Bloom:
A modular approach to key safeguarding. IEEE Trans. Inf. Theory 29(2): 208-210 (1983) - E. F. Assmus Jr.:
The binary code arising from a 2-design with a nice collection of ovals. IEEE Trans. Inf. Theory 29(3): 367-369 (1983) - E. F. Assmus Jr., Vera Pless:
On the coveting radius of extremal self-dual codes. IEEE Trans. Inf. Theory 29(3): 359-363 (1983) - Jaakko Astola, A. E. Kananen:
Signal sets derived from Steiner systems. IEEE Trans. Inf. Theory 29(1): 171-173 (1983) - David Avis, Hossam A. ElGindy:
A combinational approach to polygon similarity. IEEE Trans. Inf. Theory 29(1): 148-150 (1983) - Ronald D. Baker, Jacobus H. van Lint, Richard M. Wilson:
On the Preparata and Goethals codes. IEEE Trans. Inf. Theory 29(3): 342-344 (1983) - Tamer Basar:
The Gaussian test channel with an intelligent jammer. IEEE Trans. Inf. Theory 29(1): 152-157 (1983) - Michèle Basseville, Albert Benveniste:
Sequential detection of abrupt changes in spectral characteristics of digital signals. IEEE Trans. Inf. Theory 29(5): 709-723 (1983) - Gerard F. M. Beenker, Kees A. Schouhamer Immink:
A generalized method for encoding and decoding run-length-limited binary sequences. IEEE Trans. Inf. Theory 29(5): 751-754 (1983) - Toby Berger, Zhen Zhang:
Minimum breakdown degradation in binary source encoding. IEEE Trans. Inf. Theory 29(6): 807-813 (1983) - Elwyn R. Berlekamp:
The construction of fast, high-rate, soft decision block decoders. IEEE Trans. Inf. Theory 29(3): 372-377 (1983) - Marc R. Best:
Perfect codes hardly exist. IEEE Trans. Inf. Theory 29(3): 349-351 (1983) - Frederick J. Beutler:
Mean sojourn times in Markov queueing networks: Little's formula revisited. IEEE Trans. Inf. Theory 29(2): 233-240 (1983) - Ian F. Blake:
Review of 'Introduction to the Theory of Error-Correcting codes' (Pless, V.; 1982). IEEE Trans. Inf. Theory 29(4): 63 (1983) - J. Martin Borden:
A low-rate bound for asymmetric error-correcting codes. IEEE Trans. Inf. Theory 29(4): 600 (1983) - Russell A. Boyles, William A. Gardner:
Cycloergodic properties of discrete- parameter nonstationary stochastic processes. IEEE Trans. Inf. Theory 29(1): 105-113 (1983) - Gilles Brassard:
Relativized cryptography. IEEE Trans. Inf. Theory 29(6): 877-893 (1983) - Andries E. Brouwer:
On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code. IEEE Trans. Inf. Theory 29(3): 370-371 (1983) - Stephen P. Bruzzone, Mostafa Kaveh:
A criterion for selecting information- preserving data reductions for use in the design of multiple-parameter estimators. IEEE Trans. Inf. Theory 29(3): 466-470 (1983) - James A. Bucklew:
A note on optimal multidimensional companders. IEEE Trans. Inf. Theory 29(2): 279 (1983) - Richard S. Bucy, José M. F. Moura, A. J. Mallinckrodt:
A Monte Carlo study of absolute phase determination. IEEE Trans. Inf. Theory 29(4): 509-520 (1983) - P. L. Butzer, Wolfgang Engels:
On the implementation of the Shannon sampling series for band-limited signals. IEEE Trans. Inf. Theory 29(2): 314-318 (1983) - A. Robert Calderbank:
A square root bound on the minimum weight in quasi-cyclic codes. IEEE Trans. Inf. Theory 29(3): 332-336 (1983) - Stamatis Cambanis, Neil L. Gerr:
A simple class of asymptotically optimal quantizers. IEEE Trans. Inf. Theory 29(5): 664-676 (1983) - Stamatis Cambanis, Elias Masry:
Sampling designs for the detection of signals in noise. IEEE Trans. Inf. Theory 29(1): 83-104 (1983)
skipping 147 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 2025-01-02 18:04 CET 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