Остановите войну!
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 245 matches
- 1997
- Khaled A. S. Abdel-Ghaffar:
A lower bound on the undetected error probability and strictly optimal codes. IEEE Trans. Inf. Theory 43(5): 1489-1502 (1997) - Karim Abed-Meraim, Philippe Loubaton, Eric Moulines:
A subspace algorithm for certain blind identification problems. IEEE Trans. Inf. Theory 43(2): 499-511 (1997) - Oscar E. Agazzi, Nambirajan Seshadri:
On the use of tentative decisions to cancel intersymbol interference and nonlinear distortion (with application to magnetic recording channels). IEEE Trans. Inf. Theory 43(2): 394-408 (1997) - Rudolf Ahlswede, Ning Cai:
Correlated sources help transmission over an arbitrarily varying channel. IEEE Trans. Inf. Theory 43(4): 1254-1255 (1997) - Rudolf Ahlswede, Ning Cai, Zhen Zhang:
On interactive communication. IEEE Trans. Inf. Theory 43(1): 22-37 (1997) - Rudolf Ahlswede, Te Sun Han, Kingo Kobayashi:
Universal coding of integers and unbounded search trees. IEEE Trans. Inf. Theory 43(2): 669-682 (1997) - Rudolf Ahlswede, En-Hui Yang, Zhen Zhang:
Identification via compressed data. IEEE Trans. Inf. Theory 43(1): 48-70 (1997) - Mohamad A. Akra, Sanjoy K. Mitter:
Waveform recognition in the presence of domain and amplitude noise. IEEE Trans. Inf. Theory 43(1): 174-182 (1997) - Sulaiman Al-Bassam, Ramarathnam Venkatesan, Sultan Al-Muhammadi:
New single asymmetric error-correcting codes. IEEE Trans. Inf. Theory 43(5): 1619-1623 (1997) - Saud A. Al-Semari, Thomas E. Fuja:
I-Q TCM: reliable communication over the Rayleigh fading channel close to the cutoff rate. IEEE Trans. Inf. Theory 43(1): 250-262 (1997) - Jonathan J. Ashley, Brian H. Marcus:
A generalized state-splitting algorithm. IEEE Trans. Inf. Theory 43(4): 1326-1338 (1997) - Enzo Baccarelli, Roberto Cusani, Stefano Galli:
Novel analytical performance bounds for symbol-by-symbol decoding of digital-data impaired by ISI and AWGN. IEEE Trans. Inf. Theory 43(2): 744-750 (1997) - C. P. M. J. Baggen, Ludo M. G. M. Tolhuizen:
On Diamond codes. IEEE Trans. Inf. Theory 43(5): 1400-1411 (1997) - Tsonka Stefanova Baicheva, Evgenia D. Velikova:
Covering radii of ternary linear codes of small dimensions and codimensions. IEEE Trans. Inf. Theory 43(6): 2057-2061 (1997) - Krishna Balachandran, John B. Anderson:
Reduced complexity sequence detection for nonminimum phase intersymbol interference channels. IEEE Trans. Inf. Theory 43(1): 275-279 (1997) - José L. Balcázar, Ricard Gavaldà, Hava T. Siegelmann:
Computational power of neural networks: a characterization in terms of Kolmogorov complexity. IEEE Trans. Inf. Theory 43(4): 1175-1183 (1997) - Peter L. Bartlett, Sanjeev R. Kulkarni, S. E. Posner:
Covering numbers for real-valued function classes. IEEE Trans. Inf. Theory 43(5): 1721-1724 (1997) - Leonid A. Bassalygo, Mark S. Pinsker:
On codes correcting weakly localized errors. IEEE Trans. Inf. Theory 43(1): 363-364 (1997) - J.-C. Batllo, Vinay A. Vaishampayan:
Asymptotic performance of multiple description transform codes. IEEE Trans. Inf. Theory 43(2): 703-707 (1997) - Kristine L. Bell, Yossef Steinberg, Yariv Ephraim, Harry L. Van Trees:
Extended Ziv-Zakai lower bound for vector parameter estimation. IEEE Trans. Inf. Theory 43(2): 624-637 (1997) - Jürgen Bierbrauer, Yves Edel:
New code parameters from Reed-Solomon subfield codes. IEEE Trans. Inf. Theory 43(3): 953-968 (1997) - Simon R. Blackburn:
Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences. IEEE Trans. Inf. Theory 43(2): 537-548 (1997) - Kim L. Blackmore, Robert C. Williamson, Iven M. Y. Mareels:
Decision region approximation by polynomials or neural networks. IEEE Trans. Inf. Theory 43(3): 903-907 (1997) - Irina E. Bocharova, Boris D. Kudryashov:
Rational rate punctured convolutional codes for soft-decision Viterbi decoding. IEEE Trans. Inf. Theory 43(4): 1305-1313 (1997) - Alexis Bonnecaze, Iwan M. Duursma:
Translates of linear codes over Z4. IEEE Trans. Inf. Theory 43(4): 1218-1230 (1997) - Alexis Bonnecaze, Patrick Solé, Christine Bachoc, Bernard Mourrain:
Type II codes over Z4. IEEE Trans. Inf. Theory 43(3): 969-976 (1997) - Iliya G. Bouyukliev, Stefan M. Dodunekov, Tor Helleseth, Øyvind Ytrehus:
On the [162, 8, 80] codes. IEEE Trans. Inf. Theory 43(6): 2055-2057 (1997) - Iliya G. Bouyukliev, Stoyan N. Kapralov, Tatsuya Maruta, Masaharu Fukui:
Optimal linear codes of dimension 4 over F5. IEEE Trans. Inf. Theory 43(1): 308-313 (1997) - Serdar Boztas:
Comments on 'An inequality on guessing and its application to sequential decoding'. IEEE Trans. Inf. Theory 43(6): 2062-2063 (1997) - Alister G. Burr, Timothy J. Lunn:
Block-coded modulation optimized for finite error rate on the white Gaussian noise channel. IEEE Trans. Inf. Theory 43(1): 373-385 (1997)
skipping 215 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-04-18 14:32 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