598 research outputs found
Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes
We present algorithms for specifying the support of minimum-weight
words of extended binary BCH codes of length and designed distance
for some values of , where may
grow to infinity. The support is specified as the sum of two sets: a set of
elements, and a subspace of dimension , specified by
a basis.
In some detail, for designed distance , we have a deterministic
algorithm for even , and a probabilistic algorithm with success
probability for odd . For designed distance ,
we have a probabilistic algorithm with success probability for even . Finally, for designed distance , we have a deterministic algorithm for divisible by . We also
present a construction via Gold functions when .
Our construction builds on results of Kasami and Lin (IEEE T-IT, 1972), who
proved that for extended binary BCH codes of designed distance , the
minimum distance equals the designed distance. Their proof makes use of a
non-constructive result of Berlekamp (Inform. Contrl., 1970), and a
constructive ``down-conversion theorem'' that converts some words in BCH codes
to lower-weight words in BCH codes of lower designed distance. Our main
contribution is in replacing the non-constructive argument of Berlekamp by a
low-complexity algorithm.
In one aspect, we extends the results of Grigorescu and Kaufman (IEEE T-IT,
2012), who presented explicit minimum-weight words for designed distance
(and hence also for designed distance , by a well-known
``up-conversion theorem''), as we cover more cases of the minimum distance.
However, the minimum-weight words we construct are not affine generators for
designed distance
Self-Dual Codes
Self-dual codes are important because many of the best codes known are of
this type and they have a rich mathematical theory. Topics covered in this
survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight
enumerators, Gleason-Pierce theorem, invariant theory, Gleason theorems,
bounds, mass formulae, enumeration, extremal codes, open problems. There is a
comprehensive bibliography.Comment: 136 page
Counting hyperelliptic curves that admit a Koblitz model
Let k be a finite field of odd characteristic. We find a closed formula for
the number of k-isomorphism classes of pointed, and non-pointed, hyperelliptic
curves of genus g over k, admitting a Koblitz model. These numbers are
expressed as a polynomial in the cardinality q of k, with integer coefficients
(for pointed curves) and rational coefficients (for non-pointed curves). The
coefficients depend on g and the set of divisors of q-1 and q+1. These formulas
show that the number of hyperelliptic curves of genus g suitable (in principle)
of cryptographic applications is asymptotically (1-e^{-1})2q^{2g-1}, and not
2q^{2g-1} as it was believed. The curves of genus g=2 and g=3 are more
resistant to the attacks to the DLP; for these values of g the number of curves
is respectively (91/72)q^3+O(q^2) and (3641/2880)q^5+O(q^4)
Quaternary Affine-Invariant Codes
This thesis concerned with extended cyclic codes. The objective of this thesis is to give a full description of binary and quaternary affine-invariant codes of small dimensions. Extended cyclic codes are studied using group ring methods. Affine-invariant codes are described by their defining sets. Results are presented by enumeration of defining sets. Full description of affine-invariant codes is given for small dimension
- …