Остановите войну!
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
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,079 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) - 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) - 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) - Mert Ozates, Mohammad Kazemi, Tolga M. Duman:
Unsourced Random Access Using ODMA and Polar Codes. IEEE Wirel. Commun. Lett. 13(4): 1044-1047 (2024) - 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) - Dean Doron, S. Venkitesh:
Random Reed-Solomon Codes are List Recoverable with Optimal List Size. CoRR abs/2404.00206 (2024) - Nir Bitansky, Sapir Freizeit:
Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes. IACR Cryptol. ePrint Arch. 2024: 249 (2024) - 2023
- Thien An Nguyen, Jaejin Lee:
Sparse Code With Minimum Hamming Distance of Three for Spin-Torque Transfer Magnetic Random Access Memory. IEEE Access 11: 114071-114079 (2023) - Kefan Wang, Yuejun Wei, Zhenyuan Chen, Huarui Yin, Liping Li, Wenyi Zhang:
Reduced-search guessing random additive noise decoding of polar codes. Sci. China Inf. Sci. 66(2) (2023) - Boris Ryabko:
Unconditionally secure short key ciphers based on data compression and randomization. Des. Codes Cryptogr. 91(6): 2201-2212 (2023) - Subhabrata Samajder, Palash Sarkar:
Another look at key randomisation hypotheses. Des. Codes Cryptogr. 91(12): 3837-3855 (2023) - Brenda Mariana Hernández-Morales, Sandra Díaz-Santiago, Cuauhtemoc Mancillas-López:
Codesign for Generation of Large Random Sequences on Zynq FPGA. IEEE Embed. Syst. Lett. 15(2): 77-80 (2023) - Haiwen Cao, Jiongyue Xing, Shansuo Liang:
CRC-Aided Sparse Regression Codes for Unsourced Random Access. IEEE Commun. Lett. 27(8): 1944-1948 (2023) - Lorenzo Valentini, Elena Bernardi, Enrico Paolini:
Exploiting Pilot Mixtures in Coded Random Access. IEEE Commun. Lett. 27(12): 3330-3334 (2023) - Burak Bartan, Mert Pilanci:
Randomized Polar Codes for Anytime Distributed Machine Learning. IEEE J. Sel. Areas Inf. Theory 4: 393-404 (2023) - Ondrej Novák:
Nonlinear compression block codes: Exact and random search strategy. Microprocess. Microsystems 101: 104877 (2023) - Aicha Guefrachi, Sarra Nighaoui, Sonia Zaibi, Ammar Bouallegue:
Performance Improvement of Kötter and Kschischang Codes and Lifted Rank Metric Codes in Random Linear Network Coding. Mob. Networks Appl. 28(1): 168-177 (2023) - B. R. Vinay Kumar, Navin Kashyap, D. Yogeshwaran:
An analysis of probabilistic forwarding of coded packets on random geometric graphs. Perform. Evaluation 160: 102343 (2023) - Yao Xiao, Fenzhuo Guo, Haifeng Dong, Fei Gao:
Expanding the sharpness parameter area based on sequential $3{\rightarrow }1$ parity-oblivious quantum random access code. Quantum Inf. Process. 22(5): 195 (2023) - Yuqian Zhou, Qian-Kun Yao, Ya-Qi Dong, Dan Li, Youwen Zhu:
Source-device-independent randomness expansion using quantum random access codes. Quantum Inf. Process. 22(5): 214 (2023) - Giancarlo Gatti, Daniel Huerga, Enrique Solano, Mikel Sanz:
Random access codes via quantum contextual redundancy. Quantum 7: 895 (2023) - Anderson de Souza Barbosa, Franklin de Lima Marquezino, Renato Portugal:
Steane code analysis by randomized benchmarking. RAIRO Oper. Res. 57(2): 905-912 (2023) - Wenjiao Xie, Huisheng Zhang:
Patterned Reed-Muller Sequences with Outer A-Channel Codes and Projective Decoding for Slot-Controlled Unsourced Random Access. Sensors 23(11): 5239 (2023) - Furkan Eris, Marcia S. Louis, Kubra Eris, José Luis Abellán Miguel, Ajay Joshi:
Puppeteer: A Random Forest Based Manager for Hardware Prefetchers Across the Memory Hierarchy. ACM Trans. Archit. Code Optim. 20(1): 19:1-19:25 (2023) - Yachao Li, Jiadong Wang, Yu Wang, Pan Zhang, Lei Zuo:
Random-Frequency-Coded Waveform Optimization and Signal Coherent Accumulation Against Compound Deception Jamming. IEEE Trans. Aerosp. Electron. Syst. 59(4): 4434-4449 (2023) - Mao-Ching Chiu, Yi-Sheng Su:
Low-Rate and Short-Block-Length Random Permutation-Coded Modulations Achieve Finite-Length Bounds. IEEE Trans. Commun. 71(7): 3821-3834 (2023)
skipping 1,049 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-05-13 08:37 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