Остановите войну!
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 283 matches
- 2002
- Khaled A. S. Abdel-Ghaffar:
Repeated use of codes for error detection five times is bad. IEEE Trans. Inf. Theory 48(7): 2053-2060 (2002) - Ali Abdi:
On the second derivative of a Gaussian process envelope. IEEE Trans. Inf. Theory 48(5): 1226-1231 (2002) - Srihari Adireddy, Lang Tong, Harish Viswanathan:
Optimal placement of training for frequency-selective block-fading channels. IEEE Trans. Inf. Theory 48(8): 2338-2353 (2002) - Erik Agrell, Thomas Eriksson, Alexander Vardy, Kenneth Zeger:
Closest point search in lattices. IEEE Trans. Inf. Theory 48(8): 2201-2214 (2002) - Rudolf Ahlswede, Bernhard Balkenhol, Ning Cai:
Parallel error correcting codes. IEEE Trans. Inf. Theory 48(4): 959-962 (2002) - Rudolf Ahlswede, Ning Cai:
Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback. IEEE Trans. Inf. Theory 48(8): 2153-2162 (2002) - Rudolf Ahlswede, Andreas J. Winter:
Strong converse for identification via quantum channels. IEEE Trans. Inf. Theory 48(3): 569-579 (2002) - Fady Alajaji, Po-Ning Chen, Ziad Rached:
A note on the Poor-Verdú upper bound for the channel reliability function. IEEE Trans. Inf. Theory 48(1): 309-313 (2002) - John B. Anderson:
On the complexity of bounded distance decoding for the AWGN Channel. IEEE Trans. Inf. Theory 48(5): 1046-1060 (2002) - Erdal Arikan:
On the reliability exponent of the exponential timing channel. IEEE Trans. Inf. Theory 48(6): 1681-1689 (2002) - David K. Asano, Subbarayan Pasupathy:
Optimization of coded GMSK systems. IEEE Trans. Inf. Theory 48(10): 2768-2773 (2002) - Benjamin Audit, Emmanuel Bacry, Jean-François Muzy, Alain Arneodo:
Wavelet-based estimators of scaling behavior. IEEE Trans. Inf. Theory 48(11): 2938-2954 (2002) - Yonatan Aumann, Yan Zong Ding, Michael O. Rabin:
Everlasting security in the bounded storage model. IEEE Trans. Inf. Theory 48(6): 1668-1680 (2002) - Nuh Aydin, Dwijendra K. Ray-Chaudhuri:
Quasi-cyclic codes over Z4 and some new binary codes. IEEE Trans. Inf. Theory 48(7): 2065-2069 (2002) - Shahrnaz Azizi, Douglas Cochran, John N. McDonald:
Reproducing kernel structure and sampling on time-warped spaces with application to warped wavelets. IEEE Trans. Inf. Theory 48(3): 789-790 (2002) - Tsonka Stefanova Baicheva, Stefan M. Dodunekov, Ralf Koetter:
On the performance of the ternary [13, 7, 5] quadratic-residue code. IEEE Trans. Inf. Theory 48(2): 562-564 (2002) - Jean-Marc Bardet:
Statistical study of the wavelet analysis of fractional Brownian motion. IEEE Trans. Inf. Theory 48(4): 991-999 (2002) - Alexander Barg:
A low-rate bound on the reliability of a quantum discrete memoryless channel. IEEE Trans. Inf. Theory 48(12): 3096-3100 (2002) - Alexander Barg, G. David Forney Jr.:
Random codes: Minimum distances and error exponents. IEEE Trans. Inf. Theory 48(9): 2568-2573 (2002) - Alexander Barg, Dmitry Yu. Nogin:
Bounds on packings of spheres in the Grassmann manifold. IEEE Trans. Inf. Theory 48(9): 2450-2454 (2002) - Alexander Barg, Gilles Zémor:
Error exponents of expander codes. IEEE Trans. Inf. Theory 48(6): 1725-1729 (2002) - Charles H. Bennett, Peter W. Shor, John A. Smolin, Ashish V. Thapliyal:
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem. IEEE Trans. Inf. Theory 48(10): 2637-2655 (2002) - Tanya Y. Berger-Wolf, Edward M. Reingold:
Index assignment for multichannel communication under failure. IEEE Trans. Inf. Theory 48(10): 2656-2668 (2002) - Thierry P. Berger:
Automorphism groups of homogeneous and projective Reed-Muller codes. IEEE Trans. Inf. Theory 48(5): 1035-1045 (2002) - Toby Berger, Vladimir I. Levenshtein:
Asymptotic efficiency of two-stage disjunctive testing. IEEE Trans. Inf. Theory 48(7): 1741-1749 (2002) - Randall A. Berry, Robert G. Gallager:
Communication over fading channels with delay constraints. IEEE Trans. Inf. Theory 48(5): 1135-1149 (2002) - Ezio Biglieri, Giorgio Taricco, Antonia M. Tulino:
Performance of space-time codes for a large number of antennas. IEEE Trans. Inf. Theory 48(7): 1794-1803 (2002) - Nelson M. Blachman:
Geometric properties of a large set of random signals. IEEE Trans. Inf. Theory 48(3): 748-752 (2002) - Irina E. Bocharova, Marc Handlery, Rolf Johannesson, Boris D. Kudryashov:
Tailbiting codes obtained via convolutional codes with large active distance-slopes. IEEE Trans. Inf. Theory 48(9): 2577-2587 (2002) - Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov, Per Ståhl:
Tailbiting codes: Bounds and search results. IEEE Trans. Inf. Theory 48(1): 137-148 (2002)
skipping 253 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-04-20 02:49 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