全文获取类型
收费全文 | 73篇 |
免费 | 3篇 |
国内免费 | 1篇 |
专业分类
化学 | 6篇 |
力学 | 2篇 |
数学 | 63篇 |
物理学 | 6篇 |
出版年
2024年 | 1篇 |
2023年 | 9篇 |
2022年 | 7篇 |
2021年 | 6篇 |
2020年 | 6篇 |
2019年 | 5篇 |
2018年 | 2篇 |
2017年 | 3篇 |
2016年 | 2篇 |
2015年 | 1篇 |
2014年 | 3篇 |
2013年 | 2篇 |
2011年 | 1篇 |
2010年 | 1篇 |
2009年 | 1篇 |
2008年 | 2篇 |
2007年 | 4篇 |
2006年 | 5篇 |
2005年 | 1篇 |
2004年 | 1篇 |
2003年 | 1篇 |
2002年 | 2篇 |
2001年 | 3篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1987年 | 1篇 |
排序方式: 共有77条查询结果,搜索用时 15 毫秒
11.
We study codes over the p-adic integers and correct errors in the existing literature. We show that MDS codes exist over the p-adics for all lengths, ranks and p. We show that self-dual codes exist over the 2-adics if and only if the length is a multiple of 8 and that self-dual codes
exist over the p-adics with p odd if and only if the length is 0 (mod 4) for p ≡ 3 (mod 4) and 0 (mod 2) for p ≡ 1 (mod 4). 相似文献
12.
利用射影几何方法在小缺陷码中,NMDS码是链条件码;给出k维NμMDS(0μk-2)码满足链条件的一个充要条件与一些易判断的充分条件. 相似文献
13.
14.
XOR-based Visual Cryptography Schemes 总被引:2,自引:0,他引:2
P.?TuylsEmail author H.?D.?L.?Hollmann J.?H.?Van?Lint L.?Tolhuizen 《Designs, Codes and Cryptography》2005,37(1):169-186
A recent publication introduced a Visual Crypto (VC) system, based on the polarisation of light. This VC system has goodresolution, contrast and colour properties.Mathematically, the VC system is described by the XOR operation (modulo two addition). In this paper we investigate Threshold Visual Secret Sharing schemes associated to XOR-based VC systems. Firstly, we show that n out of n schemes with optimal resolution and contrast exist, and that (2,n) schemes are equivalent to binary codes. It turns out that these schemes have much better resolution than their OR-based counterparts. Secondly, we provide two explicit constructions for general k out of n schemes. Finally, we derive bounds on the contrast and resolution of XOR-based schemes. It follows from these bounds that for k<n, the contrast is strictly smaller than one. Moreover, the bounds imply that XOR-based k out of n schemes for even k are fundamentally different from those for odd k.AMS Classification: 94A60 相似文献
15.
Constructions and Properties of k out of n Visual Secret Sharing Schemes 总被引:10,自引:0,他引:10
The idea of visual k out of n secret sharing schemes was introduced in Naor. Explicit constructions for k = 2 and k = n can be found there. For general k out of n schemes bounds have been described.Here, two general k out of n constructions are presented. Their parameters are related to those of maximum size arcs or MDS codes. Further, results on the structure of k out of n schemes, such as bounds on their parameters, are obtained. Finally, the notion of coloured visual secret sharing schemes is introduced and a general construction is given. 相似文献
16.
17.
T. L. Alderson 《Designs, Codes and Cryptography》2006,38(1):31-40
An (n,k)q-MDS code C over an alphabet
(of size q) is a collection of qk n–tuples over
such that no two words of C agree in as many as k coordinate positions. It follows that n ≤ q+k−1. By elementary combinatorial means we show that every (6,3)4-MDS code, linear or not, turns out to be a linear (6,3)4-MDS code or else a code equivalent to a linear code with these parameters. It follows that every (5,3)4-MDS code over
must also be equivalent to linear. 相似文献
18.
In this paper, we generalize the linear complementary dual codes (LCD codes for short) to k-Galois LCD codes, and study them by a uniform method. A necessary and sufficient condition for linear codes to be k-Galois LCD codes is obtained, two classes of k-Galois LCD MDS codes are exhibited. Then, necessary and sufficient conditions for λ-constacyclic codes being k-Galois LCD codes are characterized. Some classes of k-Galois LCD λ-constacyclic MDS codes are constructed. Finally, we study Hermitian LCD λ-constacyclic codes, and present a class of Hermitian LCD λ-constacyclic MDS codes. 相似文献
19.
Vladimir N. Potapov 《组合设计杂志》2020,28(8):604-613
A pair of orthogonal latin cubes of order is equivalent to a maximum distance separable code with distance 3 or to an orthogonal array. We construct pairs of orthogonal latin cubes for sequences of previously unknown orders and . The minimal new obtained parameters of orthogonal arrays are . 相似文献
20.
MDS self-dual codes over finite fields have attracted a lot of attention in recent years by their theoretical interests in coding theory and applications in cryptography and combinatorics. In this paper we present a series of MDS self-dual codes with new length by using generalized Reed-Solomon codes and extended generalized Reed-Solomon codes as the candidates of MDS codes and taking their evaluation sets as a union of cyclotomic classes. The conditions on such MDS codes being self-dual are expressed in terms of cyclotomic numbers. 相似文献