共查询到20条相似文献,搜索用时 31 毫秒
1.
Tatsuya Maruta 《Designs, Codes and Cryptography》2001,22(2):165-177
There do not exist
codes over the Galois field GF
attaining the Griesmer bound for
for
andfor
for
. 相似文献
2.
We consider the extremal problem to determine the maximal number
of columns of a 0-1 matrix with
rows and at most
ones in each column such that each
columns are linearly independent modulo
. For fixed integers
and
, we shall prove the probabilistic lower bound
=
; for
a power of
, we prove the upper bound
which matches the lower bound for infinitely many values of
. We give some explicit constructions. 相似文献
3.
We reinterpret the state space dimension equations for geometric Goppa codes. An easy consequence is that if deg
then the state complexity of
is equal to the Wolf bound. For deg
, we use Clifford's theorem to give a simple lower bound on the state complexity of
. We then derive two further lower bounds on the state space dimensions of
in terms of the gonality sequence of
. (The gonality sequence is known for many of the function fields of interest for defining geometric Goppa codes.) One of the gonality bounds uses previous results on the generalised weight hierarchy of
and one follows in a straightforward way from first principles; often they are equal. For Hermitian codes both gonality bounds are equal to the DLP lower bound on state space dimensions. We conclude by using these results to calculate the DLP lower bound on state complexity for Hermitian codes. 相似文献
4.
Vladimir I. Levenshtein 《Designs, Codes and Cryptography》1997,12(2):131-160
A system of (Boolean) functions in
variables is called randomized if the functions preserve the property of their variables to be independent and uniformly distributed random variables. Such a system is referred to as
-resilient if for any substitution of constants for any
variables, where 0 i t, the derived system of functions in
variables will be also randomized. We investigate the problem of finding the maximum number
of functions in
variables of which any
form a
-resilient system. This problem is reduced to the minimization of the size of certain combinatorial designs, which we call split orthogonal arrays. We extend some results of design and coding theory, in particular, a duality in bounding the optimal sizes of codes and designs, in order to obtain upper and lower bounds on
. In some cases, these bounds turn out to be very tight. In particular, for some infinite subsequences of integers
they allow us to prove that
,
,
,
,
. We also find a connection of the problem considered with the construction of unequal-error-protection codes and superimposed codes for multiple access in the Hamming channel. 相似文献
5.
A. J. van Zanten 《Designs, Codes and Cryptography》1997,10(1):85-97
Let
be a list of all words of
, lexicographically ordered with respect to some basis. Lexicodes are codes constructed from
by applying a greedy algorithm. A short proof, only based on simple principles from linear algebra, is given for the linearity of these codes. The proof holds for any ordered basis, and for any selection criterion, thus generalizing the results of several authors. An extension of the applied technique shows that lexicodes over
are linear for a wide choice of bases and for a large class of selection criteria. This result generalizes a property of Conway and Sloane. 相似文献
6.
Koichi Betsumiya T. Aaron Gulliver Masaaki Harada 《Designs, Codes and Cryptography》2003,28(2):171-186
In this paper, it is shown that extremal (Hermitian) self-dual codes over
2 ×
2 exist only for lengths 1, 2, 3, 4, 5, 8 and 10. All extremal self-dual codes over
2 ×
2 are found. In particular, it is shown that there is a unique extremal self-dual code up to equivalence for lengths 8 and 10. Optimal self-dual codes are also investigated. A classification is given for binary [12, 7, 4] codes with dual distance 4, binary [13, 7, 4] codes with dual distance 4 and binary [13, 8, 4] codes with dual distance 4. 相似文献
7.
This article improves results of Hamada, Helleseth and Maekawa on minihypers in projective spaces and linear codes meeting the Griesmer bound.In [10,12],it was shown that any
-minihyper, with
, where
, is the disjoint union of
points,
lines,...,
-dimensional subspaces. For q large, we improve on this result by increasing the upper bound on
non-square, to
non-square,
square,
, and (4) for
square, p prime, p<3, to
. In the case q non-square, the conclusion is the same as written above; the minihyper is the disjoint union of subspaces. When q is square however, the minihyper is either the disjoint union of subspaces, or the disjoint union of subspaces and one subgeometry
. For the coding-theoretical problem, our results classify the corresponding
codes meeting the Griesmer bound. 相似文献
8.
Ron M. Roth 《Designs, Codes and Cryptography》1996,9(2):177-191
Codes
of length 2
m
over {1, -1} are defined as null spaces of certain submatrices of Hadamard matrices. It is shown that the codewords of
all have an rth order spectral null at zero frequency. Establishing the connection between
and the parity-check matrix of Reed-Muller codes, the minimum distance of
is obtained along with upper bounds on the redundancy of
. An efficient algorithm is presented for encoding unconstrained binary sequences into
. 相似文献
9.
There are exactlytwo non-equivalent [32,11,12]-codes in the binaryReed-Muller code
which contain
and have the weight set {0,12,16,20,32}. Alternatively,the 4-spaces in the projective space
over the vector space
for which all points have rank 4 fall into exactlytwo orbits under the natural action of PGL(5) on
. 相似文献
10.
John B. Polhill 《Designs, Codes and Cryptography》2002,25(3):299-309
There have been several recent constructions of partial difference sets (PDSs) using the Galois rings
for p a prime and t any positive integer. This paper presents constructions of partial difference sets in
where p is any prime, and r and t are any positive integers. For the case where
2$$
" align="middle" border="0">
many of the partial difference sets are constructed in groups with parameters distinct from other known constructions, and the PDSs are nested. Another construction of Paley partial difference sets is given for the case when p is odd. The constructions make use of character theory and of the structure of the Galois ring
, and in particular, the ring
×
. The paper concludes with some open related problems. 相似文献
11.
Massimo Giulietti Fernanda Pambianco Fernando Torres Emanuela Ughi 《Designs, Codes and Cryptography》2002,25(3):237-246
We point out an interplay between
-Frobenius non-classical plane curves and complete
-arcs in
. A typical example that shows how this works is the one concerning an Hermitian curve. We present some other examples here which give rise to the existence of new complete
-arcs with parameters
and
being a power of the characteristic. In addition, for q a square, new complete
-arcs with either
and
or
and
are constructed by using certain reducible plane curves. 相似文献
12.
In this paper we show that the support of the codewords of each type in the Kerdock code of length 2m over Z4 form 3-designs for any odd integer
. In particular, twonew infinite families of 3-designs are obtained in this constructionfor any odd integer
. In particular, twonew infinite families of 3-designs are obtained in this constructionfor any odd integer
, whose parameters are
,and
. 相似文献
13.
M. Bildhauer 《Journal of Mathematical Sciences》2003,115(6):2747-2752
Uniqueness is proved for solutions of the dual problem that is associated with the minimum problem
among the mappings
with prescribed Dirichlet boundary data and for smooth strictly convex integrands f of linear growth. No further assumptions on f or its conjugate function
are imposed, in particular,
is not assumed to be strictly convex. A special solution of the dual problem is seen to be a mapping into the image of
, which immediately implies uniqueness. Bibliography: 13 titles. 相似文献
14.
J. A. Thas 《Designs, Codes and Cryptography》2001,23(2):249-258
If x is a regular point of the generalizedquadrangle
of order (s,t), s 1 t, then x defines a dual net
. If
contains a line L of regularpoints and if for at least one point x on Lthe automorphism group of the dual net
satisfies certain transitivityproperties, then
is a translation generalized quadrangle. Thisresult has many applications. We give one example. Ifs=t 1, then
is a dual affine plane. Let
be a generalizedquadrangle of orders,s odd and s 1, which contains a lineL of regular points. If for at least one pointx on L the plane
is Desarguesian, then
is isomorphic to the classical generalizedquadrangleW(s). 相似文献
15.
U. Dempwolff 《Designs, Codes and Cryptography》2001,22(2):191-207
We determine the symmetric designs
which admit a group
such that G has a nonabelian socle and is a primitiverank 3 group on points (and blocks). 相似文献
16.
Analysis of the Xedni Calculus Attack 总被引:3,自引:0,他引:3
Michael J. Jacobson Neal Koblitz Joseph H. Silverman Andreas Stein Edlyn Teske 《Designs, Codes and Cryptography》2000,20(1):41-64
The xedni calculus attack on the elliptic curve discrete logarithm problem (ECDLP) involves lifting points from the finite field
to the rational numbers
and then constructing an elliptic curve over
that passes through them. If the lifted points are linearly dependent, then the ECDLP is solved. Our purpose is to analyze the practicality of this algorithm. We find that asymptotically the algorithm is virtually certain to fail, because of an absolute bound on the size of the coefficients of a relation satisfied by the lifted points. Moreover, even for smaller values of p experiments show that the odds against finding a suitable lifting are prohibitively high. 相似文献
17.
Koen Thas 《Designs, Codes and Cryptography》2002,25(3):247-253
Suppose
is a generalized quadrangle (GQ) of order
, with a regular point. Then there is a net which arises from this regular point. We prove that if such a net has a proper subnet with the same degree as the net, then it must be an affine plane of order t. Also, this affine plane induces a proper subquadrangle of order t containing the regular point, and we necessarily have that
. This result has many applications, of which we give one example. Suppose
is an elation generalized quadrangle (EGQ) of order
, with elation point p. Then
is called a skew translation generalized quadrangle (STGQ) with base-point p if there is a full group of symmetries about p of order t which is contained in the elation group. We show that a GQ
of order s is an STGQ with base-point p if and only if p is an elation point which is regular. 相似文献
18.
B. N. Cooperstein 《Designs, Codes and Cryptography》2001,23(2):185-196
The projective plane
is embedded as a variety of projective points
in
, where M is a nine dimensional
-module for the groupG=GL(3,q
2). The hyperplane sections of thisvariety and their stabilizers in the group G aredetermined. When q 2 (mod 3) one such hyperplanesection is a member of the family of Kantor's unitary ovoids.We furtherdetermine all sections
whereD has codimension two in M and demonstratethat these are never empty. Consequences are drawn for Kantor'sovoids. 相似文献
19.
P. Véron 《Designs, Codes and Cryptography》2001,24(1):81-97
We compute in this paper the true dimension over
of Goppa Codes (L, g) defined by the polynomial
proving, this way, a conjecture stated in [14,16]. 相似文献
20.
Let
and
be groups and let
be an extension of
by
. Given a property
of group compactifications, one can ask whether there exist compactifications
and
of N and K such that the universal
-compactification of G is canonically isomorphic to an extension of
by
. We prove a theorem which gives necessary and sufficient conditions for this to occur for general properties
and then apply this result to the almost periodic and weakly almost periodic compactifications of G. 相似文献