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 323 matches
- 2003
- Ali Abdi, Said Nader-Esfahani:
Expected number of maxima in the envelope of a spherically invariant random process. IEEE Trans. Inf. Theory 49(5): 1369-1375 (2003) - Taher Abualrub, Robert H. Oehmke:
On the generators of Z4 cyclic codes of length 2e. IEEE Trans. Inf. Theory 49(9): 2126-2133 (2003) - Rudolf Ahlswede, Andreas J. Winter:
Addendum to "Strong converse for identification via quantum channels". IEEE Trans. Inf. Theory 49(1): 346 (2003) - Defne Aktas, Michael P. Fitz:
Distance spectrum analysis of space-time trellis-coded Modulations in quasi-static Rayleigh-fading channels. IEEE Trans. Inf. Theory 49(12): 3335-3344 (2003) - Bader F. AlBdaiwi, Bella Bose:
Quasi-perfect Lee distance codes. IEEE Trans. Inf. Theory 49(6): 1535-1539 (2003) - Olivier Alata, Mohamed Najim, Clarisse Ramananjarasoa, Flavius Turcu:
Extension of the Schur-Cohn stability test for 2-D AR quarter-plane model. IEEE Trans. Inf. Theory 49(11): 3099-3106 (2003) - Pablo Anigstein, Venkat Anantharam:
Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum. IEEE Trans. Inf. Theory 49(4): 873-885 (2003) - G. Arico, Jos H. Weber:
Limited-trial Chase decoding. IEEE Trans. Inf. Theory 49(11): 2972-2975 (2003) - Alphonse Baartmans, Vassil Yorgov:
Some new extremal codes of lengths 76 and 78. IEEE Trans. Inf. Theory 49(5): 1353-1354 (2003) - Israfil Bahceci, Tolga M. Duman, Yucel Altunbasak:
Antenna selection for multiple-antenna transmission systems: performance analysis and code construction. IEEE Trans. Inf. Theory 49(10): 2669-2681 (2003) - Tsonka Stefanova Baicheva, Vesselin Vavrek:
On the least covering radius of binary linear codes with small lengths. IEEE Trans. Inf. Theory 49(3): 738-740 (2003) - Ivan V. Bajic, John W. Woods:
Maximum minimal distance partitioning of the Z2 lattice. IEEE Trans. Inf. Theory 49(4): 981-992 (2003) - Alexander Barg, G. R. Blakley, Gregory A. Kabatiansky:
Digital fingerprinting codes: problem statements, constructions, identification of traitors. IEEE Trans. Inf. Theory 49(4): 852-865 (2003) - Richard J. Barron, Brian Chen, Gregory W. Wornell:
The duality between information embedding and source coding with side information and some applications. IEEE Trans. Inf. Theory 49(5): 1159-1180 (2003) - P. Le Bars, Claude Le Dantec, Philippe Piret:
Bolt interleavers for turbo codes. IEEE Trans. Inf. Theory 49(2): 391-400 (2003) - Marie-Pierre Béal:
Extensions of the method of poles for code construction. IEEE Trans. Inf. Theory 49(6): 1516-1523 (2003) - Baltasar Beferull-Lozano, Antonio Ortega:
Efficient quantization for overcomplete expansions in RN. IEEE Trans. Inf. Theory 49(1): 129-150 (2003) - Charles H. Bennett, Aram W. Harrow, Debbie W. Leung, John A. Smolin:
On the capacities of bipartite Hamiltonians and unitary gates. IEEE Trans. Inf. Theory 49(8): 1895-1911 (2003) - Thierry P. Berger:
Isometries for rank distance and permutation group of Gabidulin codes. IEEE Trans. Inf. Theory 49(11): 3016-3019 (2003) - Thomas Blackford:
Negacyclic codes over Z4 of even length. IEEE Trans. Inf. Theory 49(6): 1417-1424 (2003) - Tom Bohman, Ron Holzman:
A nontrivial lower bound on the Shannon capacities of the complements of odd cycles. IEEE Trans. Inf. Theory 49(3): 721-722 (2003) - Alexis Bonnecaze, Anne Desideri Bracco, Steven T. Dougherty, L. R. Nochefranca, Patrick Solé:
Cubic self-dual binary codes. IEEE Trans. Inf. Theory 49(9): 2253-2258 (2003) - Joaquim Borges, Kevin T. Phelps, Josep Rifà:
The rank and kernel of extended 1-perfect Z4-linear and additive non-Z4-linear codes. IEEE Trans. Inf. Theory 49(8): 2028-2034 (2003) - Joaquim Borges, Kevin T. Phelps, Josep Rifà, Victor A. Zinoviev:
On Z4-linear Preparata-like and Kerdock-like code. IEEE Trans. Inf. Theory 49(11): 2834-2843 (2003) - Mohammad Jaber Borran, Ashutosh Sabharwal, Behnaam Aazhang:
On design criteria and construction of noncoherent space-time constellations. IEEE Trans. Inf. Theory 49(10): 2332-2351 (2003) - Matthias Brehler, Mahesh K. Varanasi:
Optimum receivers and low-dimensional spreaded modulation for multiuser space-time communications. IEEE Trans. Inf. Theory 49(4): 901-918 (2003) - Matthias Brehler, Mahesh K. Varanasi:
Optimum multiuser noncoherent DPSK detection in generalized diversity Rayleigh-fading channels. IEEE Trans. Inf. Theory 49(6): 1565-1574 (2003) - Matthew C. Bromberg:
Optimizing MIMO multipoint wireless networks assuming Gaussian other-user interference. IEEE Trans. Inf. Theory 49(10): 2352-2362 (2003) - Shraga I. Bross, Shlomo Shamai:
Capacity and decoding rules for the Poisson arbitrarily varying chann. IEEE Trans. Inf. Theory 49(11): 3076-3093 (2003) - Loïc Brunel, Joseph Boutros:
Lattice decoding for joint detection in direct-sequence CDMA systems. IEEE Trans. Inf. Theory 49(4): 1030-1037 (2003)
skipping 293 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-09-25 18:01 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