找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Coding, Cryptography and Combinatorics; Keqin Feng,Harald Niederreiter,Chaoping Xing Conference proceedings 2004 Springer Basel AG 2004 DE

[复制链接]
查看: 36686|回复: 61
发表于 2025-3-21 16:27:45 | 显示全部楼层 |阅读模式
书目名称Coding, Cryptography and Combinatorics
编辑Keqin Feng,Harald Niederreiter,Chaoping Xing
视频video
概述Unique collection of contributions at the frontier between mathematics and computer science
丛书名称Progress in Computer Science and Applied Logic
图书封面Titlebook: Coding, Cryptography and Combinatorics;  Keqin Feng,Harald Niederreiter,Chaoping Xing Conference proceedings 2004 Springer Basel AG 2004 DE
描述It has long been recognized that there are fascinating connections between cod­ ing theory, cryptology, and combinatorics. Therefore it seemed desirable to us to organize a conference that brings together experts from these three areas for a fruitful exchange of ideas. We decided on a venue in the Huang Shan (Yellow Mountain) region, one of the most scenic areas of China, so as to provide the additional inducement of an attractive location. The conference was planned for June 2003 with the official title Workshop on Coding, Cryptography and Combi­ natorics (CCC 2003). Those who are familiar with events in East Asia in the first half of 2003 can guess what happened in the end, namely the conference had to be cancelled in the interest of the health of the participants. The SARS epidemic posed too serious a threat. At the time of the cancellation, the organization of the conference was at an advanced stage: all invited speakers had been selected and all abstracts of contributed talks had been screened by the program committee. Thus, it was de­ cided to call on all invited speakers and presenters of accepted contributed talks to submit their manuscripts for publication in the present v
出版日期Conference proceedings 2004
关键词DES; algorithms; coding theory; complexity; cryptology; finite field; information; information theory; combi
版次1
doihttps://doi.org/10.1007/978-3-0348-7865-4
isbn_softcover978-3-0348-9602-3
isbn_ebook978-3-0348-7865-4Series ISSN 2297-0576 Series E-ISSN 2297-0584
issn_series 2297-0576
copyrightSpringer Basel AG 2004
The information of publication is updating

书目名称Coding, Cryptography and Combinatorics影响因子(影响力)




书目名称Coding, Cryptography and Combinatorics影响因子(影响力)学科排名




书目名称Coding, Cryptography and Combinatorics网络公开度




书目名称Coding, Cryptography and Combinatorics网络公开度学科排名




书目名称Coding, Cryptography and Combinatorics被引频次




书目名称Coding, Cryptography and Combinatorics被引频次学科排名




书目名称Coding, Cryptography and Combinatorics年度引用




书目名称Coding, Cryptography and Combinatorics年度引用学科排名




书目名称Coding, Cryptography and Combinatorics读者反馈




书目名称Coding, Cryptography and Combinatorics读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-22 00:16:37 | 显示全部楼层
Modularity of Asymptotically Optimal Towers of Function Fields elliptic modular curves, Shimura curves, or Drinfeld modular curves by appropriate reduction. In this paper we review the recursive asymptotically optimal towers constructed so far, discuss the reasons behind Elkies’ conjecture, present numerical evidence of this conjecture, and sketch Elkies’ proo
发表于 2025-3-22 03:35:50 | 显示全部楼层
A New Correlation Attack on LFSR Sequences with High Error Tolerance) be . bits of observed sequence such that .(.. = ..)=1/2 + δ where .. This paper presents a new efficient correlation attack on stream ciphers, which is equivalent to solve the problem of recovering the LFSR’s initial state (. = (.., ..,…,..)from the observed output sequence z. We consider the prob
发表于 2025-3-22 05:58:47 | 显示全部楼层
发表于 2025-3-22 12:46:21 | 显示全部楼层
发表于 2025-3-22 16:30:10 | 显示全部楼层
The Capacity Region of Broadcast Networks with Two Receiversf the minimal cut that separates the source and the sink. Recently, it has been shown that if the intermediate nodes in the network are allowed to code the information that they receive, then the source . can multicast common information to several sinks at a rate that does not exceed the min-cut be
发表于 2025-3-22 17:10:42 | 显示全部楼层
On the Propagation Criterion of Boolean Functions the propagation criterion of high degree were given by Preneel et al., but their algebraic degree is too small for a cryptograhic use. Then designing Boolean functions of high algebraic degree and high degree of propagation has been the goal of several papers. In this paper, we investigate the work
发表于 2025-3-23 00:54:17 | 显示全部楼层
A Polly Cracker System Based on Satisfiability describe the construction of an instance of our system – which is a modified Polly Cracker scheme – starting from such a 3-SAT formula. Then we discuss security issues: this is achieved on the one hand by exploring best methods to date for solving this particular problem, and on the other hand by s
发表于 2025-3-23 03:37:57 | 显示全部楼层
Combinatorially Designed LDPC Codes Using Zech Logarithms and Congruential Sequencesposed (γ,ρ) regular LDPC ensemble has rate . girth ≥2., and exists for all γ≥2. The codes are a subset of Gallager’s random ensemble, but contains a good combination ofstructure and (pseudo)randomness. In particular, the simple case of γ=2 results in a class of codes that are high-rate, systematic,
发表于 2025-3-23 09:24:34 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-28 01:03
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表