Results 241 to 250 of about 642,415 (277)
Some of the next articles are maybe not open access.
1998
In this chapter, we shall present some fundamental study on relatively self-dual codes over a finite commutative ring. Section 1.1 is devoted to the basic definitions and properties of such codes. In Section 1.2, we shall present our gluing technique for constructing relatively self-dual codes.
openaire +1 more source
In this chapter, we shall present some fundamental study on relatively self-dual codes over a finite commutative ring. Section 1.1 is devoted to the basic definitions and properties of such codes. In Section 1.2, we shall present our gluing technique for constructing relatively self-dual codes.
openaire +1 more source
Proceedings IEEE International Symposium on Information Theory,, 2003
A group code is an ideal in a suitable group algebra. Cyclic codes, Reed-Muller codes, the binary extended Golay code and many other remarkable codes are group codes. In this paper we answer the following question: Under what conditions do exist self-dual group codes over Galois rings?.
openaire +1 more source
A group code is an ideal in a suitable group algebra. Cyclic codes, Reed-Muller codes, the binary extended Golay code and many other remarkable codes are group codes. In this paper we answer the following question: Under what conditions do exist self-dual group codes over Galois rings?.
openaire +1 more source
Formally Self-Dual Codes Related to Type II Codes
Applicable Algebra in Engineering, Communication and Computing, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Betsumiya, Koichi, Harada, Masaaki
openaire +1 more source
Weight enumerators of self-dual codes
IEEE Transactions on Information Theory, 1991Some construction techniques for self-dual codes are investigated, and the authors construct a singly-even self-dual (48,24,10)-code with a weight enumerator that was not known to be attainable. It is shown that there exists a singly-even self-dual code C' of length n=48 and minimum weight d=10 whose weight enumerator is prescribed in the work of J.H ...
R.A. Brualdi, V.S. Pless
openaire +1 more source
IEEE Transactions on Information Theory, 2003
We study binary self-dual codes with a fixed point free automorphism of order three. All binary codes of that type can be obtained by a cubic construction that generalizes Turyn's. We regard such "cubic" codes of length 3/spl lscr/ as codes of length /spl lscr/ over the ring F/sub 2//spl times/F/sub 4/. Classical notions of Type II codes, shadow codes,
Bonnecaze, Alexis +4 more
openaire +1 more source
We study binary self-dual codes with a fixed point free automorphism of order three. All binary codes of that type can be obtained by a cubic construction that generalizes Turyn's. We regard such "cubic" codes of length 3/spl lscr/ as codes of length /spl lscr/ over the ring F/sub 2//spl times/F/sub 4/. Classical notions of Type II codes, shadow codes,
Bonnecaze, Alexis +4 more
openaire +1 more source
Applicable Algebra in Engineering, Communication and Computing, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kai, Xiaoshan, Zhu, Shixin
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kai, Xiaoshan, Zhu, Shixin
openaire +1 more source
Self-Dual Codes and Self-Dual Designs
1990We construct self-orthogonal binary codes from projective 2 - (v, k, λ) designs with a polarity, k odd, and λ even. We give arithmetic conditions on the parameters of the design to obtain self-dual or doubly even self-dual codes. Non existence results in the latter case are obtained from rationality conditions of certain strongly regular graphs.
openaire +1 more source
2016
The authors investigate the existence of new extremal self dual codes. In orderto construct such codes, they present general methods for constructing self-dual codes and they obtain extremal self-dual codes having weight enumerators for which extremal codes were not previously known to exist, using some matrices.
Harada, Masaaki, Kimura, Hiroshi
openaire +2 more sources
The authors investigate the existence of new extremal self dual codes. In orderto construct such codes, they present general methods for constructing self-dual codes and they obtain extremal self-dual codes having weight enumerators for which extremal codes were not previously known to exist, using some matrices.
Harada, Masaaki, Kimura, Hiroshi
openaire +2 more sources
IEEE Transactions on Information Theory, 2008
In this correspondence, we construct new self-dual codes over F4, F5, F7 with larger minimum weights than the previously known self-dual codes, using construction methods based on circulant and negacirculant matrices. In particular, a self-dual [36,18,13] code over F7 is constructed which has a larger minimum weight than the previously known [36,18 ...
T. Aaron Gulliver, Masaaki Harada
openaire +1 more source
In this correspondence, we construct new self-dual codes over F4, F5, F7 with larger minimum weights than the previously known self-dual codes, using construction methods based on circulant and negacirculant matrices. In particular, a self-dual [36,18,13] code over F7 is constructed which has a larger minimum weight than the previously known [36,18 ...
T. Aaron Gulliver, Masaaki Harada
openaire +1 more source
Self-dual codes from smaller lengths of self-dual codes and recursive algorithm
2013Summary: Self-dual codes have received great attention by researchers since the beginning of coding theory. In this work, some construction methods for this kind of codes are composed which produce new self-dual codes from self-dual codes of smaller lengths. A special one of these methods, called recursive algorithm, is also mentioned.
Topcu, Hatice, AKTAŞ, Hacı
openaire +2 more sources