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
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 1,104 matches
- 2024
- Osel Lhamo, Mingyu Ma, Tung V. Doan, Tobias Scheinert, Giang T. Nguyen, Martin Reisslein, Frank H. P. Fitzek:
RED-SP-CoDel: Random early detection with static priority scheduling and controlled delay AQM in programmable data planes. Comput. Commun. 214: 149-166 (2024) - Lorenzo Valentini, Marco Chiani, Enrico Paolini:
Stochastic Geometry Design for Cell-Free Coded Random Access. IEEE Commun. Lett. 28(8): 1964-1968 (2024) - Enrico Testi, Velio Tralli, Enrico Paolini:
Access Point Cooperation Strategies for Coded Random Access in Cell-Free Massive MIMO. IEEE Internet Things J. 11(17): 27916-27931 (2024) - Márton Erdélyi, Pál Hegedüs, Sándor Z. Kiss, Gábor Péter Nagy:
On linear codes with random multiplier vectors and the maximum trace dimension property. J. Math. Cryptol. 18(1) (2024) - Achal Lama, Soumik Ray, Tufleuddin Biswas, Lakshmi Narsimhaiah, Yashpal Singh Raghav, Promil Kapoor, K. N. Singh, Pradeep Mishra, Bishal Gurung:
Python code for modeling ARIMA-LSTM architecture with random forest algorithm. Softw. Impacts 20: 100650 (2024) - Chengying Huan, Yongchao Liu, Heng Zhang, Shuaiwen Song, Santosh Pandey, Shiyang Chen, Xiangfei Fang, Yue Jin, Baptiste Lepers, Yanjun Wu, Hang Liu:
TEA+: A Novel Temporal Graph Random Walk Engine with Hybrid Storage Architecture. ACM Trans. Archit. Code Optim. 21(2): 37 (2024) - Magali Bardet, Rocco Mora, Jean-Pierre Tillich:
Polynomial Time Key-Recovery Attack on High Rate Random Alternant Codes. IEEE Trans. Inf. Theory 70(6): 4492-4511 (2024) - Lan V. Truong, Giuseppe Cocco, Josep Font-Segura, Albert Guillén i Fàbregas:
Corrections to "Concentration Properties of Random Codes". IEEE Trans. Inf. Theory 70(7): 5412 (2024) - Lan V. Truong, Albert Guillén i Fàbregas:
Generalized Random Gilbert-Varshamov Codes: Typical Error Exponent and Concentration Properties. IEEE Trans. Inf. Theory 70(2): 820-853 (2024) - Recep Can Yavas, Victoria Kostina, Michelle Effros:
Variable-Length Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels. IEEE Trans. Inf. Theory 70(4): 2367-2394 (2024) - Zhentian Zhang, Jian Dang, Zaichen Zhang, Liang Wu, Bingcheng Zhu, Lei Wang:
Pilot-Free Unsourced Random Access via Dictionary Learning and Error-Correcting Codes. IEEE Trans. Wirel. Commun. 23(7): 7488-7502 (2024) - Mert Ozates, Mohammad Kazemi, Tolga M. Duman:
Unsourced Random Access Using ODMA and Polar Codes. IEEE Wirel. Commun. Lett. 13(4): 1044-1047 (2024) - Kuan Cheng, Minghui Ouyang, Chong Shangguan, Yuanting Shen:
When Can an Expander Code Correct Ω(n) Errors in O(n) Time? APPROX/RANDOM 2024: 61:1-61:23 - Dean Doron, Jonathan Mosheiff, Mary Wootters:
When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound? APPROX/RANDOM 2024: 53:1-53:12 - Surendra Ghentiyala, Noah Stephens-Davidowitz:
More Basis Reduction for Linear Codes: Backward Reduction, BKZ, Slide Reduction, and More. APPROX/RANDOM 2024: 19:1-19:22 - Venkatesan Guruswami, Hsin-Po Wang:
Capacity-Achieving Gray Codes. APPROX/RANDOM 2024: 65:1-65:9 - Nir Bitansky, Sapir Freizeit:
Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes. CRYPTO (8) 2024: 109-135 - Enrico Testi, Velio Tralli, Enrico Paolini:
Coded Random Access in Cell-Free Massive MIMO Networks with Access Point Signal Combining. ICC Workshops 2024: 620-625 - Jiameng Cheng, Chenhao Zhang, Hongwei Zhang, Cong Wang, Jinsong Wang:
A Full-Lifecycle Malicious Code Detection Scheme Based on RASP and Random Forest. ICIC (LNAI 2) 2024: 281-293 - Omar Alrabiah, Venkatesan Guruswami, Ray Li:
Randomly Punctured Reed-Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields. STOC 2024: 1458-1469 - Oded Regev:
On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. CoRR abs/2401.03703 (2024) - Serge Kas Hanna:
Short Systematic Codes for Correcting Random Edit Errors in DNA Storage. CoRR abs/2402.01244 (2024) - Jonathan Mosheiff, Nicolas Resch, Kuo Shang, Chen Yuan:
Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes. CoRR abs/2402.11533 (2024) - Qianfan Wang, Yiwen Wang, Yixin Wang, Jifan Liang, Xiao Ma:
Random Staircase Generator Matrix Codes. CoRR abs/2402.16245 (2024) - Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang:
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. CoRR abs/2404.13230 (2024) - Shobhit Bhatnagar, P. Vijay Kumar:
On Streaming Codes for Burst and Random Errors. CoRR abs/2405.06606 (2024) - Shobhit Bhatnagar, Biswadip Chakraborty, P. Vijay Kumar:
On Streaming Codes for Simultaneously Correcting Burst and Random Erasures. CoRR abs/2405.06621 (2024) - Ryan Song, Kareem M. Attiah, Wei Yu:
Coded Downlink Massive Random Access and a Finite de Finetti Theorem. CoRR abs/2405.08301 (2024) - Tianya Li, Yongpeng Wu, Junyuan Gao, Wenjun Zhang, Xiang-Gen Xia, Derrick Wing Kwan Ng, Chengshan Xiao:
Asynchronous MIMO-OFDM Massive Unsourced Random Access with Codeword Collisions. CoRR abs/2405.11883 (2024) - Matan Levi, Jonathan Mosheiff, Nikhil Shagrithaya:
Local Properties of Reed-Solomon Codes and Random Linear Codes. CoRR abs/2406.02238 (2024)
skipping 1,074 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-22 12:25 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