Остановите войну!
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 472 matches
- 2017
- Lei Yu, Houqiang Li, Weiping Li:
Source-Channel Secrecy for Shannon Cipher System. IEEE Trans. Inf. Theory 63(4): 2596-2622 (2017) - Jie Chen, Feng Jiang, A. Lee Swindlehurst:
The Gaussian CEO Problem for Scalar Sources With Arbitrary Memory. IEEE Trans. Inf. Theory 63(7): 4286-4297 (2017) - Luís Daniel Abreu, José Luis Romero:
MSE Estimates for Multitaper Spectral Estimation and Off-Grid Compressive Sensing. IEEE Trans. Inf. Theory 63(12): 7770-7776 (2017) - Jayadev Acharya, Alon Orlitsky, Ananda Theertha Suresh, Himanshu Tyagi:
Estimating Renyi Entropy of Discrete Distributions. IEEE Trans. Inf. Theory 63(1): 38-56 (2017) - Nitzan Adler, Yuval Cassuto:
Burst-Erasure Correcting Codes With Optimal Average Delay. IEEE Trans. Inf. Theory 63(5): 2848-2865 (2017) - Alekh Agarwal, Animashree Anandkumar, Praneeth Netrapalli:
A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries. IEEE Trans. Inf. Theory 63(1): 575-592 (2017) - Ebad Ahmed, Aaron B. Wagner:
Coding for the Large-Alphabet Adversarial Channel. IEEE Trans. Inf. Theory 63(10): 6347-6363 (2017) - Ain Ul Aisha, Lifeng Lai, Yingbin Liang, Shlomo Shamai Shitz:
On the Sum-Rate Capacity of Poisson MISO Multiple Access Channels. IEEE Trans. Inf. Theory 63(10): 6457-6473 (2017) - Cem Aksoylar, George K. Atia, Venkatesh Saligrama:
Sparse Signal Processing With Linear and Nonlinear Observations: A Unified Shannon-Theoretic Approach. IEEE Trans. Inf. Theory 63(2): 749-776 (2017) - Matthew Aldridge:
The Capacity of Bernoulli Nonadaptive Group Testing. IEEE Trans. Inf. Theory 63(11): 7142-7148 (2017) - Noga Alon, Jehoshua Bruck, Farzad Farnoud Hassanzadeh, Siddharth Jain:
Duplication Distance to the Root for Binary Sequences. IEEE Trans. Inf. Theory 63(12): 7793-7803 (2017) - Noga Alon, Klim Efremenko, Benny Sudakov:
Testing Equality in Communication Graphs. IEEE Trans. Inf. Theory 63(11): 7569-7574 (2017) - Selma Belhadj Amor, Samir Medina Perlaza, Ioannis Krikidis, H. Vincent Poor:
Feedback Enhances Simultaneous Wireless Information and Energy Transmission in Multiple Access Channels. IEEE Trans. Inf. Theory 63(8): 5244-5265 (2017) - Farhad Pourkamali-Anaraki, Stephen Becker:
Preconditioned Data Sparsification for Big Data With Applications to PCA and K-Means. IEEE Trans. Inf. Theory 63(5): 2954-2974 (2017) - Anatoly V. Anisimov, Igor O. Zavadskyi:
Variable-Length Prefix Codes With Multiple Delimiters. IEEE Trans. Inf. Theory 63(5): 2885-2895 (2017) - Nicholas Asendorf, Raj Rao Nadakuditi:
Improved Detection of Correlated Signals in Low-Rank-Plus-Noise Type Data Sets Using Informative Canonical Correlation Analysis (ICCA). IEEE Trans. Inf. Theory 63(6): 3451-3467 (2017) - Bruno Tenório Ávila, Ricardo M. Campello de Souza:
Meta-Fibonacci Codes: Efficient Universal Coding of Natural Numbers. IEEE Trans. Inf. Theory 63(4): 2357-2375 (2017) - Ismail Aydogdu, Taher Abualrub, Irfan Siap:
ℤ2ℤ2[u]-Cyclic and Constacyclic Codes. IEEE Trans. Inf. Theory 63(8): 4883-4893 (2017) - Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Emil R. Vaughan, Søren Riis:
Graph Guessing Games and Non-Shannon Information Inequalities. IEEE Trans. Inf. Theory 63(7): 4257-4267 (2017) - Dave Bacon, Steven T. Flammia, Aram W. Harrow, Jonathan Shi:
Sparse Quantum Codes From Quantum Circuits. IEEE Trans. Inf. Theory 63(4): 2464-2479 (2017) - Ahmed Badr, Pratik Patil, Ashish Khisti, Wai-Tian Tan, John G. Apostolopoulos:
Layered Constructions for Low-Delay Streaming Codes. IEEE Trans. Inf. Theory 63(1): 111-141 (2017) - Simeon Ball, Jan De Beule:
On Subsets of the Normal Rational Curve. IEEE Trans. Inf. Theory 63(6): 3658-3662 (2017) - Richard G. Baraniuk, Simon Foucart, Deanna Needell, Yaniv Plan, Mary Wootters:
Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals. IEEE Trans. Inf. Theory 63(6): 3368-3385 (2017) - Jean Barbier, Florent Krzakala:
Approximate Message-Passing Decoder and Capacity Achieving Sparse Superposition Codes. IEEE Trans. Inf. Theory 63(8): 4894-4927 (2017) - Alexander Barg, Arya Mazumdar:
Group Testing Schemes From Codes and Designs. IEEE Trans. Inf. Theory 63(11): 7131-7141 (2017) - Alexander Barg, Itzhak Tamo, Serge G. Vladut:
Locally Recoverable Codes on Algebraic Curves. IEEE Trans. Inf. Theory 63(8): 4928-4939 (2017) - Louay Bazzi:
Corrections to "Weight Distribution of Cosets of Small Codes With Good Dual Properties". IEEE Trans. Inf. Theory 63(11): 7615 (2017) - Merle Behr, Axel Munk:
Identifiability for Blind Source Separation of Multiple Finite Alphabet Linear Mixtures. IEEE Trans. Inf. Theory 63(9): 5506-5517 (2017) - Assaf Ben-Yishai, Ofer Shayevitz:
Interactive Schemes for the AWGN Channel with Noisy Feedback. IEEE Trans. Inf. Theory 63(4): 2409-2427 (2017) - Meryem Benammar, Pablo Piantanida, Shlomo Shamai Shitz:
Capacity Results for the Multicast Cognitive Interference Channel. IEEE Trans. Inf. Theory 63(7): 4119-4136 (2017)
skipping 442 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-09 18:31 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