Results 271 to 280 of about 4,270,277 (317)
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
IEEE Transactions on Information Theory, 1983
It is shown that if the automorphism group of a binary self-dual code satisfies a certain condition then the code contains words of weight congruent to 2 modulo 4 . In particular, no cyclic binary self-dual code can have all its weights divisible by four. The number of cyclic binary self-dual codes of length n is determined, and the shortest nontrivial
Sloane, N. J. A., Thompson, J. G.
openaire +2 more sources
It is shown that if the automorphism group of a binary self-dual code satisfies a certain condition then the code contains words of weight congruent to 2 modulo 4 . In particular, no cyclic binary self-dual code can have all its weights divisible by four. The number of cyclic binary self-dual codes of length n is determined, and the shortest nontrivial
Sloane, N. J. A., Thompson, J. G.
openaire +2 more sources
Dual transform and projective self-dual codes
Advances in Mathematics of CommunicationsThe authors study linear codes using the projective dual transform. Their approach is to represent codes by a characteristic vector and the characteristic vector of the projective dual is obtained as a product of a special matrix by the characteristic vector of the input code.
Bouyukliev, Iliya, Bouyuklieva, Stefka
openaire +2 more sources
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
The Dual Code of some Reed-Muller type Codes
Applicable Algebra in Engineering, Communication and Computing, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
González-Sarabia, M., Rentería, C.
openaire +2 more sources
Self-Dual Codes Over Chain Rings
Mathematics in Computer Science, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eisenbarth, Simon, Nebe, Gabriele
openaire +2 more sources
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
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
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
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