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 490 matches
- 2020
- Min Ye
, Emmanuel Abbe:
Recursive Projection-Aggregation Decoding of Reed-Muller Codes. IEEE Trans. Inf. Theory 66(8): 4948-4965 (2020) - Yi Liu
, Pengfei Huang
, Alexander W. Bergman, Paul H. Siegel
:
Rate-Constrained Shaping Codes for Structured Sources. IEEE Trans. Inf. Theory 66(8): 5261-5281 (2020) - Emmanuel Abbe, Min Ye
:
Reed-Muller Codes Polarize. IEEE Trans. Inf. Theory 66(12): 7311-7332 (2020) - Amir Aboubacar
, Mohamed El Machkouri
:
Recursive Kernel Density Estimation for Time Series. IEEE Trans. Inf. Theory 66(10): 6378-6388 (2020) - Jayadev Acharya
, Clément L. Canonne
, Himanshu Tyagi
:
Inference Under Information Constraints I: Lower Bounds From Chi-Square Contraction. IEEE Trans. Inf. Theory 66(12): 7835-7855 (2020) - Jayadev Acharya
, Clément L. Canonne
, Himanshu Tyagi
:
Inference Under Information Constraints II: Communication Constraints and Shared Randomness. IEEE Trans. Inf. Theory 66(12): 7856-7877 (2020) - Avik Ranjan Adhikary
, Sudhan Majhi
, Zi Long Liu
, Yong Liang Guan
:
New Sets of Optimal Odd-Length Binary Z-Complementary Pairs. IEEE Trans. Inf. Theory 66(1): 669-678 (2020) - Gaurav Kumar Agarwal
, Martina Cardone
, Christina Fragouli
:
On Secure Network Coding for Multiple Unicast Traffic. IEEE Trans. Inf. Theory 66(8): 5204-5227 (2020) - Rohit Agrawal
:
Finite-Sample Concentration of the Multinomial in Relative Entropy. IEEE Trans. Inf. Theory 66(10): 6297-6302 (2020) - Ali Ahmed
, Justin Romberg
:
Compressive Sampling of Ensembles of Correlated Signals. IEEE Trans. Inf. Theory 66(2): 1078-1098 (2020) - Tim L. Alderson
:
On the Weights of General MDS Codes. IEEE Trans. Inf. Theory 66(9): 5414-5418 (2020) - Mohammad A. Alhejji
, Graeme Smith:
Monotonicity Under Local Operations: Linear Entropic Formulas. IEEE Trans. Inf. Theory 66(8): 5055-5060 (2020) - Paulo José Fernandes Almeida
, Julia Lieb
:
Complete j-MDP Convolutional Codes. IEEE Trans. Inf. Theory 66(12): 7348-7359 (2020) - Hassan Aly
, Arne Winterhof
:
A Note on Hall's Sextic Residue Sequence: Correlation Measure of Order $k$ and Related Measures of Pseudorandomness. IEEE Trans. Inf. Theory 66(3): 1944-1947 (2020) - Vamsi K. Amalladinne
, Jean-François Chamberland
, Krishna R. Narayanan
:
A Coded Compressed Sensing Scheme for Unsourced Multiple Access. IEEE Trans. Inf. Theory 66(10): 6509-6533 (2020) - Dennis Amelunxen, Martin Lotz
, Jake Walvin:
Effective Condition Number Bounds for Convex Regularization. IEEE Trans. Inf. Theory 66(4): 2501-2516 (2020) - Arthur Américo
, M. H. R. Khouzani, Pasquale Malacaria
:
Conditional Entropy and Data Processing: An Axiomatic Approach Based on Core-Concavity. IEEE Trans. Inf. Theory 66(9): 5537-5547 (2020) - Anurag Anshu
, Mario Berta
, Rahul Jain
, Marco Tomamichel
:
Partially Smoothed Information Measures. IEEE Trans. Inf. Theory 66(8): 5022-5036 (2020) - Anurag Anshu
, Min-Hsiu Hsieh
, Rahul Jain
:
Noisy Quantum State Redistribution With Promise and the Alpha-Bit. IEEE Trans. Inf. Theory 66(12): 7772-7786 (2020) - Anurag Anshu
, Masahito Hayashi
, Naqueeb Ahmad Warsi
:
Secure Communication Over Fully Quantum Gel'fand-Pinsker Wiretap Channel. IEEE Trans. Inf. Theory 66(9): 5548-5566 (2020) - Anurag Anshu
, Penghui Yao
:
On the Compression of Messages in the Multi-Party Setting. IEEE Trans. Inf. Theory 66(4): 2091-2114 (2020) - Laure Aptel
, Aslan Tchamkerten
:
Bits Through Queues With Feedback. IEEE Trans. Inf. Theory 66(6): 3317-3326 (2020) - Ahmed Arafa
, Jing Yang
, Sennur Ulukus
, H. Vincent Poor
:
Age-Minimal Transmission for Energy Harvesting Sensors With Finite Batteries: Online Policies. IEEE Trans. Inf. Theory 66(1): 534-556 (2020) - Makoto Araya
, Masaaki Harada
, Ken Saito:
Quaternary Hermitian Linear Complementary Dual Codes. IEEE Trans. Inf. Theory 66(5): 2751-2759 (2020) - Fatemeh Arbabjolfaei
, Young-Han Kim
:
Generalized Lexicographic Products and the Index Coding Capacity. IEEE Trans. Inf. Theory 66(3): 1520-1529 (2020) - Natan Ardimanov
, Ofer Shayevitz
, Itzhak Tamo
:
Minimum Guesswork With an Unreliable Oracle. IEEE Trans. Inf. Theory 66(12): 7528-7538 (2020) - Mohamed Adel Attia, Deepak Kumar, Ravi Tandon
:
The Capacity of Private Information Retrieval From Uncoded Storage Constrained Databases. IEEE Trans. Inf. Theory 66(11): 6617-6634 (2020) - Morgane Austern
, Arian Maleki
:
On the Gaussianity of Kolmogorov Complexity of Mixing Sequences. IEEE Trans. Inf. Theory 66(2): 1232-1247 (2020) - Balaji Srinivasan Babu, Ganesh R. Kini
, P. Vijay Kumar
:
A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures. IEEE Trans. Inf. Theory 66(2): 1023-1052 (2020) - Mirza Uzair Baig
, Anders Høst-Madsen
, Aria Nosratinia
:
Discrete Modulation for Interference Mitigation. IEEE Trans. Inf. Theory 66(5): 3026-3039 (2020)
skipping 460 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 2026-05-01 05:08 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