找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Coding and Cryptology; Third International Yeow Meng Chee,Zhenbo Guo,Chaoping Xing Conference proceedings 2011 Springer Berlin Heidelberg

[复制链接]
楼主: panache
发表于 2025-3-28 14:57:24 | 显示全部楼层
Seeing Ourselves Through Technologylowing reliable reconstruction of an arbitrary data bit from looking at only a small number of randomly chosen codeword bits. Local decodability comes at the price of certain loss in terms of code efficiency. Specifically, locally decodable codes require longer codeword lengths than their classical
发表于 2025-3-28 20:11:47 | 显示全部楼层
https://doi.org/10.1057/9781137476661e logarithm of a given value, was proposed in the literature to show the reduction between the discrete logarithm problem and the factoring problem. The CSREP was also used to construct certain cryptography systems. In this paper, we analyze the complexity of the CSREP, and show that under proper co
发表于 2025-3-28 23:27:42 | 显示全部楼层
发表于 2025-3-29 04:26:17 | 显示全部楼层
发表于 2025-3-29 09:24:14 | 显示全部楼层
List Decoding for Binary Goppa Codes,, approximately . errors in a length-. classical irreducible degree-. binary Goppa code. Compared to the best previous polynomial-time list-decoding algorithms for the same codes, the new algorithm corrects approximately . extra errors.
发表于 2025-3-29 14:32:29 | 显示全部楼层
The Minimum Distance of Graph Codes, to be codewords in a component code. In particular we treat such codes from bipartite expander graphs coming from Euclidean planes and other geometries. We give results on the minimum distances of the codes.
发表于 2025-3-29 16:58:56 | 显示全部楼层
Conference proceedings 2011-June 3, 2011. The 19 revised full technical papers are contributed by the invited speakers of the workshop. The papers were carefully reviewed and cover a broad range of foundational and methodological as well as applicative issues in coding and cryptology, as well as related areas such as combinatorics.
发表于 2025-3-29 20:50:55 | 显示全部楼层
发表于 2025-3-30 00:48:26 | 显示全部楼层
Timothy P. Johnson,Tom W. Smitha message shown in the clear. Compared to the Boneh-Boyen signature scheme, the proposed scheme yields a shorter proof of validity and is based on a more desirable hardness assumption that achieves a better security bound when analyzed in the generic group model.
发表于 2025-3-30 04:11:15 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-12 17:15
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表