Остановите войну!
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 54 matches
- 2012
- Cédric Marchand, Mohamed Ben Hammouda, Yvan Eustache, Laura Conde-Canencia, Emmanuel Boutillon:
Design and implementation of a near maximum likelihood decoder for Cortex codes. ISTC 2012: 26-30 - Martin Ågren, Martin Hell, Thomas Johansson, Carl Löndahl:
Improved message passing techniques in fast correlation attacks on stream ciphers. ISTC 2012: 260-264 - Seok-Ki Ahn, Kyeongcheol Yang:
Importance sampling for performance estimation of LDPC codes over Rayleigh fading channels. ISTC 2012: 86-90 - Florence Alberge:
Pairwise joint probability propagation in BICM-ID. ISTC 2012: 6-10 - Khoirul Anwar, Tad Matsumoto:
Three-way relaying systems using iterative spatial demapping. ISTC 2012: 96-100 - Mihai-Alin Badiu, Carles Navarro i Manchon, Vasile Bota, Bernard Henri Fleury:
Distributed iterative processing for interference channels with receiver cooperation. ISTC 2012: 140-144 - Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
High-rate QC LDPC codes of short and moderate length with good girth profile. ISTC 2012: 150-154 - Stefano Chinnici, Paolo Spallaccini:
Fast simulation of turbo codes on GPUs. ISTC 2012: 61-65 - Jean Dion, Marie-Hélène Hamon, Pierre Penard, Matthieu Arzel, Michel Jézéquel:
Adapted scheduling of QC-LDPC decoding for multistandard receivers. ISTC 2012: 111-115 - Ammar El Falou, Charlotte Langlais, Charbel Abdel Nour, Catherine Douillard:
Low ML-detection complexity, adaptive 2×2 STBC, with powerful FEC codes. ISTC 2012: 195-199 - Jan Geldmacher, Jürgen Götze:
On fault tolerant decoding of Turbo codes. ISTC 2012: 245-249 - Vincent Gripon, Vitaly Skachek, Warren J. Gross, Michael G. Rabbat:
Random clique codes. ISTC 2012: 121-125 - Lorenzo Guerrieri, Paola Bisaglia, Maurizio Martina, Guido Masera:
Reducing the memory for iteration-exchanged information and border future metrics in the HomePlug AV turbo decoder implementation. ISTC 2012: 180-184 - Salim Haddad, Amer Baghdadi, Michel Jézéquel:
Adaptive complexity MIMO turbo receiver applying turbo demodulation. ISTC 2012: 235-239 - Nissim Halabi, Guy Even:
Local-optimality guarantees for optimal decoding based on paths. ISTC 2012: 205-209 - Dapeng Hao, Peter Adam Hoeher:
A low-complexity tree search detection algorithm for superposition modulation. ISTC 2012: 145-149 - Werner Haselmayr, Bernhard Etzlinger, Andreas Springer:
Equalization of MIMO-ISI channels based on Gaussian message passing in factor graphs. ISTC 2012: 76-80 - Najeeb ul Hassan, Michael Lentmaier, Gerhard P. Fettweis:
Comparison of LDPC block and LDPC convolutional codes based on their decoding latency. ISTC 2012: 225-229 - Thomas Ilnseher, Frank Kienle, Christian Weis, Norbert Wehn:
A 2.15GBit/s turbo code decoder for LTE advanced base station applications. ISTC 2012: 21-25 - Mohd Azri Mohd Izhar, Norsheila Fisal, Xiaobo Zhou, Khoirul Anwar, Tad Matsumoto:
Utilization of 2-D Markov source correlation using block turbo codes. ISTC 2012: 56-60 - Alexandros Katsiotis, Nicholas Kalouptsidis, Panagiotis Rizomiliotis:
Recursive flexible convolutional encoders for parallel concatenation. ISTC 2012: 250-254 - Yong Jin Daniel Kim, Jan Bajcsy:
An architecture for faster than Nyquist Turbo broadcasting. ISTC 2012: 170-174 - Gottfried Lechner, Sarah J. Johnson:
Absorbing sets and cycles. ISTC 2012: 185-189 - Daniel N. Liu, Michael P. Fitz:
Iterative equalization in non-linear satellite channels. ISTC 2012: 220-224 - Gianluigi Liva, Balázs Matuz, Enrico Paolini, Marco Chiani:
Short low-rate non-binary turbo codes. ISTC 2012: 41-45 - Y. Min, Francis Chung-Ming Lau, Chi K. Tse:
Generalized LDPC code with single-parity-check product constraints at super check nodes. ISTC 2012: 165-169 - Mohamad Mostafa, Werner G. Teich, Jürgen Lindner:
Analysis of high order recurrent neural networks for analog decoding. ISTC 2012: 116-120 - Krishna R. Narayanan, Henry D. Pfister:
Iterative collision resolution for slotted ALOHA: An optimal uncoordinated transmission policy. ISTC 2012: 136-139 - Walter Nitzold, Michael Lentmaier, Gerhard P. Fettweis:
Spatially coupled protograph-based LDPC codes for incremental redundancy. ISTC 2012: 155-159 - Stefan Nowak, Ruediger Kays:
Interleaver design for spectrally-efficient bit-interleaved LDPC-coded modulation. ISTC 2012: 240-244
skipping 24 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-27 09:30 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