307 research outputs found
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
A new class of codes for Boolean masking of cryptographic computations
We introduce a new class of rate one-half binary codes: {\bf complementary
information set codes.} A binary linear code of length and dimension
is called a complementary information set code (CIS code for short) if it has
two disjoint information sets. This class of codes contains self-dual codes as
a subclass. It is connected to graph correlation immune Boolean functions of
use in the security of hardware implementations of cryptographic primitives.
Such codes permit to improve the cost of masking cryptographic algorithms
against side channel attacks. In this paper we investigate this new class of
codes: we give optimal or best known CIS codes of length We derive
general constructions based on cyclic codes and on double circulant codes. We
derive a Varshamov-Gilbert bound for long CIS codes, and show that they can all
be classified in small lengths by the building up construction. Some
nonlinear permutations are constructed by using -codes, based on the
notion of dual distance of an unrestricted code.Comment: 19 pages. IEEE Trans. on Information Theory, to appea
On some new extremal Type II Z4-codes of length 40
Using the building-up method and a modification of the doubling method we construct new extremal Type II Z4-codes of length 40. The constructed codes of type , for ,
are the first examples of extremal Type II Z4-codes of given type and length 40 whose residue codes have minimum weight greater than or equal to 8. Further, we use minimum weight codewords for a construction of 1-designs, some of which are self-orthogonal
New extremal binary self-dual codes of length 68 via short kharaghani array over f_2 + uf_2
In this work, new construction methods for self-dual codes are given. The
methods use the short Kharaghani array and a variation of it. These are
applicable to any commutative Frobenius ring. We apply the constructions over
the ring F_2 + uF_2 and self-dual Type I [64, 32, 12]_2-codes with various
weight enumerators obtained as Gray images. By the use of an extension theorem
for self-dual codes we were able to construct 27 new extremal binary self-dual
codes of length 68. The existence of the extremal binary self-dual codes with
these weight enumerators was previously unknown.Comment: 10 pages, 5 table
Self-Dual Codes over Commutative Frobenius Rings
We prove that self-dual codes exist over all finite commutative Frobenius rings, via their decomposition by the Chinese Remainder Theorem into local rings. We construct non-free self-dual codes under some conditions, using self-dual codes over finite fields, and we also construct free self-dual codes by lifting elements from the base finite field. We generalize the building-up construction for finite commutative Frobenius rings, showing that all self-dual codes with minimum weight greater than 2 can be obtained in this manner in cases where the construction applies. Key Words: Self-dual codes, codes over rings. 2
- …