Остановите войну!
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 64 matches
- 2023
- Ismaila Salihou Adamou, Elsa Dupraz, Amin Zribi, Tad Matsumoto:
Error-Exponent of Distributed Hypothesis Testing for Gilbert-Elliot Source Models. ISTC 2023: 1-5 - Masoumeh Alinia, David G. M. Mitchell:
Optimizing Parameters in Soft-hard BPGD for Lossy Source Coding. ISTC 2023: 1-5 - Amaael Antonini, Wenhui Sui, Brendan Towell, Dariush Divsalar, Jon Hamkins, Richard D. Wesel:
Suppressing Error Floors in SCPPM via an Efficient CRC-aided List Viterbi Decoding Algorithm. ISTC 2023: 1-5 - Irina E. Bocharova, Boris D. Kudryashov, Sander Mikelsaar, Vitaly Skachek:
Shaping for NB QC-LDPC Coded QAM Signals. ISTC 2023: 1-5 - Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek:
LDPC coded QAM signaling: Mapping and Shaping. ISTC 2023: 1-6 - Emmanuel Boutillon:
C4-Sequences: Rate Adaptive Coded Modulation for Few Bits Message. ISTC 2023: 1-5 - Simon Brown, Jérémy Nadal, François Leduc-Primeau:
Low-Activity Gallager-B LDPC Decoding. ISTC 2023: 1-5 - Chao Chen, Suihua Cai, Yunghsiang S. Han, Nianqi Tang, Baoming Bai:
Fast Encoding of Extended Integrated Interleaved Codes Based on Two-Dimensional LCH-FFT. ISTC 2023: 1-5 - Yiyao Cheng, Lei Liu, Shansuo Liang, Jonathan H. Manton, Li Ping:
Orthogonal AMP for Problems with Multiple Measurement Vectors and/or Multiple Transforms. ISTC 2023: 1-5 - Henry Chimal-Dzul, Anthony Gómez-Fonseca:
Using Partial Orthomorphisms to Construct Short Quasi-Cyclic LDPC Codes with Girth at Least 6. ISTC 2023: 1-5 - Hui Chu, Chen Wang, Yiwei Zhang:
Improved constructions of secondary structure avoidance codes for DNA sequences. ISTC 2023: 1-5 - Jannis Clausius, Marvin Geiselhart, Stephan ten Brink:
Component Training of Turbo Autoencoders. ISTC 2023: 1-5 - Julien du Crest, Francisco Garcia-Herrero, Mehdi Mhalla, Valentin Savin, Javier Valls:
Layered Decoding of Quantum LDPC Codes. ISTC 2023: 1-5 - Beyza Dabak, Ece Tiryaki, A. Robert Calderbank, Ahmed H. Hareedy:
LDPC Decoders Prefer More Reliable Parity Bits: Unequal Data Protection Over BSC. ISTC 2023: 1-5 - Malek Ellouze, Romain Tajan, Camille Leroux, Christophe Jégo, Charly Poulliat:
Low-Complexity Algorithm for the Minimum Distance Properties of PAC Codes. ISTC 2023: 1-5 - Jian Fang, Baoming Bai, Ruimin Yuan, Rongchi Xu, Xiao Ma, Chung-Li Wang:
Superposition Construction of Globally-Coupled LDPC Codes for MIMO Communication. ISTC 2023: 1-5 - Alexander Fengler, Alejandro Lancho, Yury Polyanskiy:
Coded Orthogonal Modulation for the Multi-Antenna MAC. ISTC 2023: 1-5 - Marvin Geiselhart, Jannis Clausius, Stephan ten Brink:
Rate-Compatible Polar Codes for Automorphism Ensemble Decoding. ISTC 2023: 1-5 - Marvin Geiselhart, Marc Gauger, Felix Krieg, Jannis Clausius, Stephan ten Brink:
Phase-Equivariant Polar Coded Modulation. ISTC 2023: 1-5 - Pascal Giard, Syed Aizaz Ali Shah, Alexios Balatsoukas-Stimming, Maximilian Stark, Gerhard Bauch:
Unrolled and Pipelined Decoders based on Look-Up Tables for Polar Codes. ISTC 2023: 1-5 - Anthony Gómez-Fonseca, Roxana Smarandache, David G. M. Mitchell:
A Low Complexity PEG-like Algorithm to Construct Quasi-Cyclic LDPC Codes. ISTC 2023: 1-5 - Ashutosh Goswami, Mehdi Mhalla, Valentin Savin:
Improved Rate Fault-Tolerant Preparation of Q1 Code-States. ISTC 2023: 1-5 - Maxim Goukhshtein, Stark C. Draper:
Polar Coded Distribution Matching for Probabilistic Shaping and Stealth Communication. ISTC 2023: 1-5 - Oliver Griebel, Matthias Herrmann, Bilal Hammoud, Norbert Wehn:
Energy-Efficient Decoding of Spatially Coupled Low-Density Parity-Check Codes using Adaptive Window Sizes. ISTC 2023: 1-5 - Nian Guo, Shansuo Liang, Wei Han:
Power Allocation for the Base Matrix of Spatially Coupled Sparse Regression Codes. ISTC 2023: 1-5 - Salman Habib, David G. M. Mitchell:
Reinforcement Learning for Sequential Decoding of Generalized LDPC Codes. ISTC 2023: 1-5 - Abir Hannachi, Luiz Anet Neto, Jean-Claude Carlach, Ramesh Pyndiah:
Performance of Flexible and Low complexity Decoding RS-SPC Product Codes for Short-Packet Communications. ISTC 2023: 1-5 - Joseph Jabour, Ali Chamas Al Ghouwayel, Emmanuel Boutillon:
Asymmetrical Extended Min-Sum for Successive Cancellation Decoding of Non-Binary Polar Codes. ISTC 2023: 1-5 - Lucas Johannsen, Claus Kestel, Marvin Geiselhart, Timo Vogt, Stephan ten Brink, Norbert Wehn:
Successive Cancellation Automorphism List Decoding of Polar Codes. ISTC 2023: 1-5 - Jacob King, William E. Ryan, Chester Hulse, Richard D. Wesel:
Efficient Maximum-Likelihood Decoding for TBCC and CRC-TBCC Codes via Parallel List Viterbi. ISTC 2023: 1-5
skipping 34 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-06-06 07:59 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