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 97 matches
- 2016
- Zheng Wang, Cong Ling:
Symmetric Metropolis-within-Gibbs algorithm for lattice Gaussian sampling. ITW 2016: 394-398 - Ehsan Abbasi, Christos Thrampoulidis, Babak Hassibi:
General performance metrics for the LASSO. ITW 2016: 181-185 - Inaki Estella Aguerri, Abdellatif Zaidi:
Lossy compression for compute-and-forward in limited backhaul wireless relay networks. ITW 2016: 295-299 - Ramy E. Ali, Viveck R. Cadambe:
Consistent distributed storage of correlated data updates via multi-version coding. ITW 2016: 176-180 - Mohammad Mohammadi Amiri, Qianqian Yang, Deniz Gündüz:
Coded caching for a large number of users. ITW 2016: 171-175 - Jayant Apte, Qi Chen, John MacLaren Walsh:
Symmetries in the entropy space. ITW 2016: 51-55 - Keerthi Suria Kumar Arumugam, Matthieu R. Bloch:
Keyless asynchronous covert communication. ITW 2016: 191-195 - Jean Barbier, Mohamad Dia, Nicolas Macris:
Threshold saturation of spatially coupled sparse superposition codes for all memoryless channels. ITW 2016: 76-80 - Meryem Benammar, Abdellatif Zaidi:
On lossy source coding with equivocation constraints. ITW 2016: 369-373 - Ali Bereyhi, Ralf R. Müller, Hermann Schulz-Baldes:
RSB decoupling property of MAP estimators. ITW 2016: 379-383 - Vivek S. Borkar, Nikhil Karamchandani, Sharad Mirani:
Randomized Kaczmarz for rank aggregation from pairwise comparisons. ITW 2016: 389-393 - Alexey Buzuverov, Hussein Al-Shatri, Anja Klein:
On the achievable degrees of freedom of the MIMO X-channel with delayed CSIT. ITW 2016: 464-468 - Antonio Campello, Cong Ling, Jean-Claude Belfiore:
Algebraic lattices achieving the capacity of the ergodic fading channel. ITW 2016: 459-463 - Giulia Cervia, Laura Luzzi, Matthieu R. Bloch, Maël Le Treust:
Polar coding for empirical coordination of signals and actions over noisy channels. ITW 2016: 81-85 - Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
When is omniscience a rate-optimal strategy for achieving secret key capacity? ITW 2016: 354-358 - Sung-En Chiu, Tara Javidi:
Sequential measurement-dependent noisy search. ITW 2016: 221-225 - Il Yong Chun, Ben Adcock:
Optimal sparse recovery for multi-sensor measurements. ITW 2016: 270-274 - Maxime Ferreira Da Costa, Wei Dai:
Achieving super-resolution in multi-rate sampling systems via efficient semidefinite programming. ITW 2016: 424-428 - Rahul Devassy, Giuseppe Durisi, Benjamin Lindqvist, Wei Yang, Marco Dalai:
Nonasymptotic coding-rate bounds for binary erasure channels with feedback. ITW 2016: 86-90 - Meik Dorpinghaus:
A lower bound on the entropy rate for a large class of stationary processes and its relation to the hyperplane conjecture. ITW 2016: 374-378 - Jinfeng Du, Muriel Médard, Shlomo Shamai:
Cost of local cooperation in hierarchical virtual MIMO transmission schemes. ITW 2016: 285-289 - Alex Dytso, Ronit Bustin, Daniela Tuninetti, Natasha Devroye, H. Vincent Poor, Shlomo Shamai:
On the applications of the minimum mean p-th error (MMPE) to information theoretic quantities. ITW 2016: 66-70 - Rafah El-Khatib, Nicolas Macris:
The velocity of the propagating wave for general coupled scalar systems. ITW 2016: 246-250 - Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Improving Belief Propagation decoding of polar codes using scattered EXIT charts. ITW 2016: 91-95 - Adel M. Elmahdy, Amr El-Keyi, Yahya Mohasseb, Tamer A. ElBatt, Mohammed Nafie, Karim G. Seddik:
Asymmetric degrees of freedom of the full-duplex MIMO 3-way channel. ITW 2016: 469-473 - Yafit Feldman, Anelia Somekh-Baruch:
Channels with state information and mismatched decoding. ITW 2016: 419-423 - Josep Font-Segura, Alfonso Martinez, Albert Guillen i Fabregas:
Asymptotics of the random-coding union bound in quasi-static fading channels. ITW 2016: 251-254 - Massimo Franceschetti:
A universal bound on the ϵ-entropy of bandlimited radiation. ITW 2016: 56-60 - Oliver Wilhelm Gnilke, Ha Thanh Nguyen Tran, Alex Karrila, Camilla Hollanti:
Well-rounded lattices for reliability and security in Rayleigh fading SISO channels. ITW 2016: 359-363 - Mario Goldenbaum, Holger Boche, H. Vincent Poor:
On secure computation over the binary modulo-2 adder multiple-access wiretap channel. ITW 2016: 21-25
skipping 67 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-11-26 07:41 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