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 467 matches
- 2016
- Andreas J. Winter
, Dong Yang:
Potential Capacities of Quantum Channels. IEEE Trans. Inf. Theory 62(3): 1415-1424 (2016) - Emmanuel Abbe, Noga Alon, Afonso S. Bandeira, Colin Sandon:
Linear Boolean Classification, Coding and the Critical Problem. IEEE Trans. Inf. Theory 62(4): 1667-1673 (2016) - Emmanuel Abbe, Afonso S. Bandeira, Georgina Hall:
Exact Recovery in the Stochastic Block Model. IEEE Trans. Inf. Theory 62(1): 471-487 (2016) - Felix Abramovich
, Vadim Grinshtein:
Model Selection and Minimax Estimation in Generalized Linear Models. IEEE Trans. Inf. Theory 62(6): 3721-3730 (2016) - Abhishek Agarwal, Arya Mazumdar
:
Security in Locally Repairable Storage. IEEE Trans. Inf. Theory 62(11): 6204-6217 (2016) - Divesh Aggarwal, Ueli Maurer:
Breaking RSA Generically Is Equivalent to Factoring. IEEE Trans. Inf. Theory 62(11): 6251-6259 (2016) - Inaki Estella Aguerri, Deniz Gündüz
:
Joint Source-Channel Coding With Time-Varying Channel and Side-Information. IEEE Trans. Inf. Theory 62(2): 736-753 (2016) - Inaki Estella Aguerri, Deniz Gündüz
:
Capacity of a Class of State-Dependent Orthogonal Relay Channels. IEEE Trans. Inf. Theory 62(3): 1280-1295 (2016) - Inaki Estella Aguerri, Deniz Gündüz
:
Distortion Exponent in MIMO Fading Channels With Time-Varying Source Side Information. IEEE Trans. Inf. Theory 62(6): 3597-3617 (2016) - Seiseki Akibue
, Mio Murao
:
Network Coding for Distributed Quantum Computation Over Cluster and Butterfly Networks. IEEE Trans. Inf. Theory 62(11): 6620-6637 (2016) - Mine Alsan
, Emre Telatar:
A Simple Proof of Polarization and Polarization for Non-Stationary Memoryless Channels. IEEE Trans. Inf. Theory 62(9): 4873-4878 (2016) - Sarah E. Anderson, Gretchen L. Matthews
:
Stopping Sets of Hermitian Codes. IEEE Trans. Inf. Theory 62(11): 6304-6314 (2016) - Iryna Andriyanova, Alexandre Graell i Amat
:
Threshold Saturation for Nonbinary SC-LDPC Codes on the Binary Erasure Channel. IEEE Trans. Inf. Theory 62(5): 2622-2638 (2016) - Anurag Anshu
, Rahul Jain
, Priyanka Mukhopadhyay
, Ala Shayeghi, Penghui Yao:
New One Shot Quantum Protocols With Application to Communication Complexity. IEEE Trans. Inf. Theory 62(12): 7566-7577 (2016) - Erdal Arikan
:
Varentropy Decreases Under the Polar Transform. IEEE Trans. Inf. Theory 62(6): 3390-3400 (2016) - Mehdi Ashraphijuo, Vaneet Aggarwal
, Xiaodong Wang
:
On the Symmetric $K$ -User Interference Channels With Limited Feedback. IEEE Trans. Inf. Theory 62(12): 6969-6985 (2016) - Mehdi Ashraphijuo, Ali Tajer
, Chen Gong, Xiaodong Wang:
A Receiver-centric Approach to Interference Management: Fairness and Outage Optimization. IEEE Trans. Inf. Theory 62(10): 5619-5642 (2016) - Emmanuel Bacry, Jean-François Muzy
:
First- and Second-Order Statistics Characterization of Hawkes Processes and Non-Parametric Estimation. IEEE Trans. Inf. Theory 62(4): 2184-2202 (2016) - Sohail Bahmani, Petros T. Boufounos, Bhiksha Raj:
Learning Model-Based Sparsity via Projected Gradient Descent. IEEE Trans. Inf. Theory 62(4): 2092-2099 (2016) - Mayank Bakshi
, Sidharth Jaggi, Sheng Cai, Minghua Chen
:
SHO-FA: Robust Compressive Sensing With Order-Optimal Complexity, Measurements, and Bits. IEEE Trans. Inf. Theory 62(12): 7419-7444 (2016) - Luca Baldassarre
, Nirav Bhan, Volkan Cevher
, Anastasios Kyrillidis, Siddhartha Satpathi:
Group-Sparse Model Selection: Hardness and Relaxations. IEEE Trans. Inf. Theory 62(11): 6508-6534 (2016) - Jingjun Bao, Lijun Ji
:
Frequency Hopping Sequences With Optimal Partial Hamming Correlation. IEEE Trans. Inf. Theory 62(6): 3768-3783 (2016) - Jingjun Bao, Lijun Ji:
New Families of Optimal Frequency Hopping Sequence Sets. IEEE Trans. Inf. Theory 62(9): 5209-5224 (2016) - Yuliy M. Baryshnikov
, Jaroslaw Jarek Duda, Wojciech Szpankowski
:
Types of Markov Fields and Tilings. IEEE Trans. Inf. Theory 62(8): 4361-4375 (2016) - Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv:
Subspace Polynomials and Cyclic Subspace Codes. IEEE Trans. Inf. Theory 62(3): 1157-1165 (2016) - Meryem Benammar
, Abdellatif Zaidi:
Rate-Distortion Function for a Heegard-Berger Problem With Two Sources and Degraded Reconstruction Sets. IEEE Trans. Inf. Theory 62(9): 5080-5092 (2016) - José Joaquín Bernal
, Diana H. Bueno-Carreño
, Juan Jacobo Simón
:
Apparent Distance and a Notion of BCH Multivariate Codes. IEEE Trans. Inf. Theory 62(2): 655-668 (2016) - Mario Berta
, Matthias Christandl, Dave Touchette:
Smooth Entropy Bounds on One-Shot Quantum State Redistribution. IEEE Trans. Inf. Theory 62(3): 1425-1439 (2016) - Mario Berta
, Marco Tomamichel
:
The Fidelity of Recovery Is Multiplicative. IEEE Trans. Inf. Theory 62(4): 1758-1763 (2016) - Khodakhast Bibak
, Bruce M. Kapron
, Venkatesh Srinivasan:
The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs. IEEE Trans. Inf. Theory 62(11): 6355-6358 (2016)
skipping 437 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-08-16 16:40 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