咨询与建议

限定检索结果

文献类型

  • 1,054 册 图书
  • 18 篇 期刊文献
  • 4 篇 会议
  • 1 篇 学位论文

馆藏范围

  • 1,077 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 28 篇 工学
    • 24 篇 计算机科学与技术...
    • 10 篇 电气工程
    • 5 篇 信息与通信工程
    • 2 篇 控制科学与工程
    • 2 篇 软件工程
    • 1 篇 电子科学与技术(可...
  • 12 篇 理学
    • 12 篇 数学
    • 2 篇 系统科学
  • 3 篇 管理学
    • 2 篇 管理科学与工程(可...
    • 1 篇 图书情报与档案管...

主题

  • 1,077 篇 coding and infor...
  • 384 篇 cryptology
  • 353 篇 computer communi...
  • 209 篇 systems and data...
  • 177 篇 artificial intel...
  • 171 篇 information syst...
  • 155 篇 algorithm analys...
  • 154 篇 computer systems...
  • 118 篇 data structures ...
  • 103 篇 discrete mathema...
  • 88 篇 communications e...
  • 86 篇 software enginee...
  • 85 篇 computer applica...
  • 82 篇 theory of comput...
  • 73 篇 management of co...
  • 65 篇 computer system ...
  • 65 篇 user interfaces ...
  • 64 篇 computers and so...
  • 64 篇 special purpose ...
  • 62 篇 e-commerce/e-bus...

机构

  • 16 篇 swansea universi...
  • 13 篇 university of ag...
  • 11 篇 university of wa...
  • 11 篇 delft university...
  • 11 篇 nanyang technolo...
  • 11 篇 boston universit...
  • 10 篇 tsinghua univers...
  • 9 篇 chinese academy ...
  • 8 篇 shanghai jiao to...
  • 8 篇 university of tu...
  • 8 篇 banaras hindu un...
  • 8 篇 abv-indian insti...
  • 8 篇 indian institute...
  • 7 篇 university of ma...
  • 7 篇 kingdee internat...
  • 7 篇 university of wa...
  • 7 篇 university of we...
  • 7 篇 new jersey insti...
  • 6 篇 cranfield univer...
  • 6 篇 coventry univers...

作者

  • 15 篇 yogesh k. dwived...
  • 14 篇 dongdai lin
  • 11 篇 moti yung
  • 10 篇 leonid reyzin
  • 10 篇 liang-jie zhang
  • 10 篇 douglas stebila
  • 9 篇 friedrich l. bau...
  • 9 篇 marijn janssen
  • 8 篇 anshul verma
  • 8 篇 matti mäntymäki
  • 8 篇 peter parycek
  • 8 篇 gregor von ciemi...
  • 8 篇 kiran kumar patt...
  • 8 篇 pradeepika verma
  • 7 篇 june wei
  • 7 篇 tsuyoshi takagi
  • 7 篇 abderrahmane nit...
  • 6 篇 david romero
  • 6 篇 daniel thalmann
  • 6 篇 nadia magnenat-t...

语言

  • 1,068 篇 英文
  • 9 篇 中文
检索条件"主题词=coding and information theory"
1077 条 记 录,以下是1-10 订阅
排序:
RQC Revisited and More Cryptanalysis for Rank-Based Cryptography
收藏 引用
IEEE TRANSACTIONS ON information theory 2024年 第3期70卷 2271-2286页
作者: Bidoux, Loic Briaud, Pierre Bros, Maxime Gaborit, Philippe Technol Innovat Inst Cryptog Res Ctr Abu Dhabi U Arab Emirates Inria F-75012 Paris France Sorbonne Univ UPMC Univ F-75006 Paris France Natl Inst Stand & Technol Gaithersburg MD 20899 USA Univ Limoges CNRS XLIM F-87000 Limoges France
In this paper, we revisit the Rank Quasi-Cyclic (RQC) (Melchor et al., IEEE IT, 2018) encryption scheme by proposing three possible variations for its design. Our first improvement relies on the introduction of Augmen... 详细信息
来源: 评论
Bounding Quantum Capacities via Partial Orders and Complementarity
收藏 引用
IEEE TRANSACTIONS ON information theory 2023年 第1期69卷 283-297页
作者: Hirche, Christoph Leditzky, Felix Tech Univ Munich Zentrum Math D-85748 Garching Germany Natl Univ Singapore Ctr Quantum Technol Singapore 119077 Singapore Dept Math Univ Illinois Urbana Champaign Illinois Quantum Informat Sci & Technol Ctr IQUIS Urbana IL 61801 USA
Quantum capacities are fundamental quantities that are notoriously hard to compute and can exhibit surprising properties such as superadditivity. Thus, a vast amount of literature is devoted to finding tight and compu... 详细信息
来源: 评论
Fast list decoding of univariate multiplicity and folded Reed-Solomon codes  65
Fast list decoding of univariate multiplicity and folded Ree...
收藏 引用
65th Symposium on Foundations of Computer Science
作者: Goyal, Rohan Harsha, Prahladh Kumar, Mrinal Shankar, Ashutosh MIT 77 Massachusetts Ave Cambridge MA 02139 USA Tata Inst Fundamental Res Mumbai Maharashtra India
We show that the known list-decoding algorithms for univariate multiplicity and folded Reed-Solomon (FRS) codes can be made to run in (O) over tilde (n) time. Univariate multiplicity codes and FRS codes are natural va... 详细信息
来源: 评论
Privacy-Preserving Public Release of Datasets for Support Vector Machine Classification
收藏 引用
IEEE TRANSACTIONS ON BIG DATA 2021年 第5期7卷 893-899页
作者: Farokhi, Farhad CSIROs Data61 Docklands Vic 3008 Australia Univ Melbourne Parkville Vic 3010 Australia
We consider the problem of publicly releasing a dataset for support vector machine classification while not infringing on the privacy of data subjects (i.e., individuals whose private information is stored in the data... 详细信息
来源: 评论
An efficient queries processing model based on Multi Broadcast Searchable Keywords Encryption (MBSKE)
收藏 引用
AD HOC NETWORKS 2020年 98卷
作者: Al-Maytami, Belal Ali Fan, Pingzhi Hussain, Abir Jaafar Baker, Thar Liatsis, Panos Southwest Jiaotong Univ Inst Mobile Commun Chengdu Peoples R China Liverpool John Moores Univ Dept Comp Sci Liverpool L3 3AF Merseyside England Khalifa Univ Sci & Technol Dept Elect Engn & Comp Sci Abu Dhabi U Arab Emirates
Cloud computing is a technology which has enabled many organizations to outsource their data in an encrypted form to improve processing times. The public Internet was not initially designed to handle massive quantitie... 详细信息
来源: 评论
coding by minimal linear grammars
收藏 引用
THEORETICAL COMPUTER SCIENCE 2020年 834卷 14-25页
作者: Carpi, Arturo D'Alessandro, Flavio Univ Perugia Dipartimento Matemat & Informat Via Vanvitelli 1 I-06123 Perugia Italy Univ Roma La Sapienza Dipartimento Matemat Piazzale Aldo Moro 2 I-00185 Rome Italy Bogazici Univ Dept Math TR-34342 Istanbul Turkey
This paper concerns the structure and the properties of a special class of combinatorial systems called minimal linear grammars. The role of unambiguous minimal linear grammars is investigated in the framework of the ... 详细信息
来源: 评论
Number theory Meets Wireless Communications  1st ed. 2020
收藏 引用
丛书名: Mathematical Engineering
2020年
作者: Victor Beresnevich Alister Burr Bobak Nazer Sanju Velani
This volume explores the rich interplay between number theory and wireless communications, reviewing the surprisingly deep connections between these fields and presenting new research directions to inspire future rese... 详细信息
来源: 评论
Nearly optimal robust secret sharing
收藏 引用
DESIGNS CODES AND CRYPTOGRAPHY 2019年 第8期87卷 1777-1796页
作者: Cheraghchi, Mahdi Imperial Coll London Dept Comp London England
We prove that a known general approach to improve Shamir's celebrated secret sharing scheme;i.e., adding an information-theoretic authentication tag to the secret, can make it robust for n parties against any coll... 详细信息
来源: 评论
Channel coding Techniques for Wireless Communications  2nd ed. 2019
收藏 引用
丛书名: Forum for Interdisciplinary Mathematics
2019年
作者: K. Deergha Rao
This book discusses the latest channel coding techniques, MIMO systems, and 5G channel coding evolution. It provides a comprehensive overview of channel coding, covering modern techniques such as turbo codes, low-dens... 详细信息
来源: 评论
Linear-time list recovery of high-rate expander codes
收藏 引用
information AND COMPUTATION 2018年 261卷 202-218页
作者: Hemenway, Brett Wootters, Mary Univ Penn Dept Comp & Informat Sci Philadelphia PA 19104 USA Stanford Univ Dept Comp Sci Stanford CA 94305 USA
We show that expander codes, when properly instantiated, are high-rate list recoverable codes with linear-time list recovery algorithms. List recoverable codes have applications to constructing efficiently list-decoda... 详细信息
来源: 评论