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 125 matches
- 2020
- Bin Dai, Chong Li, Yingbin Liang, Zheng Ma, Shlomo Shamai Shitz:
On the Capacity of Gaussian Multiple-Access Wiretap Channels with Feedback. ISITA 2020: 397-401 - Min Zhu, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.:
Decoder Error Propagation Mitigation for Spatially Coupled LDPC Codes. ISITA 2020: 175-179 - Yoshiki Abe, Mitsugu Iwamoto, Kazuo Ohta:
How to Detect Malicious Behaviors in a Card-Based Majority Voting Protocol with Three Inputs. ISITA 2020: 377-381 - Mojtaba Abolfazli, Anders Høst-Madsen, June Zhang:
Differential Description Length for Hyperparameter Selection in Supervised Learning. ISITA 2020: 592-596 - Srinivas Avasarala, Sharang M. Sriram, Soumya Jana:
On Berger-Tung Inner Bound for Sum-Rate versus Sum-Distortion Problem. ISITA 2020: 56-60 - Parisa Babaheidarian, Somayeh Salimi, Panos Papadimitratos:
Scalable Security in Interference Channels With Arbitrary Number of Users. ISITA 2020: 402-406 - Mohammadamin Baniasadi, Ertem Tuncel:
Minimum Energy Analysis for Robust Gaussian Joint Source-Channel Coding with a Square-Law Profile. ISITA 2020: 51-55 - Rawad Bitar, Ilia Smagloy, Lorenz Welter, Antonia Wachter-Zeh, Eitan Yaakobi:
Criss-Cross Deletion Correcting Codes. ISITA 2020: 304-308 - Rawad Bitar, Marvin Xhemrishi, Antonia Wachter-Zeh:
Fountain Codes for Private Distributed Matrix-Matrix Multiplication. ISITA 2020: 480-484 - Boris Ryabko, Viacheslav Zhuravlev:
The time-adaptive statistical testing for random number generators. ISITA 2020: 344-347 - Yi-Hsuan Chen, Yu-Ting Liu, Chung-Hsuan Wang, Chi-Chao Chao:
Analysis of UEP QC-LDPC Codes Using Density Evolution. ISITA 2020: 230-234 - Johan Chrisnata, Han Mao Kiah, Eitan Yaakobi:
Optimal Reconstruction Codes for Deletion Channels. ISITA 2020: 279-283 - Luca D'Alessio, Litian Liu, Ken Duffy, Yonina C. Eldar, Muriel Médard, Mehrtash Babadi:
A Coding Theory Perspective on Multiplexed Molecular Profiling of Biological Tissues. ISITA 2020: 309-313 - Yanyan Dong, Shenghao Yang:
On Optimal Finite-length Binary Codes of Four Codewords for Binary Symmetric Channels. ISITA 2020: 146-150 - Ilya Dumer, Navid Gharavi:
Codes for high-noise memoryless channels. ISITA 2020: 101-105 - Sota Eguchi, Takeru Miyazaki, Shunsuke Araki, Satoshi Uehara, Yasuyuki Nogami:
A Study on Randomness of Sequences Obtained from Piecewise Logistic Map over Integers. ISITA 2020: 451-455 - Ramy F. Taki ElDin, Hajime Matsui:
Generator Polynomial Matrices of Reversed and Reversible Quasi-Cyclic Codes. ISITA 2020: 165-169 - Keita Emura, Shiho Moriai, Takuma Nakajima, Masato Yoshimi:
Cache-22: A Highly Deployable Encrypted Cache System. ISITA 2020: 465-469 - Reo Eriguchi, Noboru Kunihiro, Koji Nuida:
A Linear Algebraic Approach to Strongly Secure Ramp Secret Sharing for General Access Structures. ISITA 2020: 427-431 - Lóránt Farkas:
Trellis Code Error Exponent From Results for Asynchronous Multiple Access Channels. ISITA 2020: 46-50 - Ryan Gabrys, Paul H. Siegel, Eitan Yaakobi:
Segmented Reverse Concatenation: A New Approach to Constrained ECC. ISITA 2020: 254-258 - Onur Günlü, Peter Trifonov, Muah Kim, Rafael F. Schaefer, Vladimir Sidorenko:
Randomized Nested Polar Subcode Constructions for Privacy, Secrecy, and Storage. ISITA 2020: 475-479 - Shreya Gupta, V. Lalitha:
Rack-Aware Cooperative Regenerating Codes. ISITA 2020: 264-268 - Manabu Hagiwara:
Conversion Method from Erasure Codes to Multi-Deletion Error-Correcting Codes for Information in Array Design. ISITA 2020: 274-278 - Haiyun He, Qiaosheng Eric Zhang, Vincent Y. F. Tan:
Optimal Resolution of Change-Point Detection with Empirically Observed Statistics and Erasures. ISITA 2020: 582-586 - Tomonori Hirata, Yuichi Kaji:
Information leakage through passive timing attacks on RSA decryption system. ISITA 2020: 392-396 - Gou Hosoya, Toshihiro Niinomi:
Performance of Non-Binary LDPC Codes on Two-Dimensional Array Erasure Models. ISITA 2020: 220-224 - Anders Høst-Madsen, N. Whitcomb, J. Weldon, Zixiang Xiong:
Latency-Energy Tradeoff with Realistic Hardware Models. ISITA 2020: 539-543 - Anders Høst-Madsen, Heecheol Yang, Minchul Kim, Jungwoo Lee:
Repair of Multiple Descriptions on Distributed Storage. ISITA 2020: 245-249 - Yung-Tsao Hsu, Mao-Chao Lin:
A Design of Differentially Encoded LDPC Coding Based on Multi-Edge Framework. ISITA 2020: 210-214
skipping 95 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-12-26 22:12 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