Results 251 to 260 of about 645,715 (278)

Extremal binary self-dual codes

IEEE Transactions on Information Theory, 1997
Summary: In this correspondence, we investigate binary extremal self-dual codes. Numerous extremal self-dual codes and interesting self-dual codes with minimum weight \(d=14\) and 16 are constructed. In particular, the first extremal Type I \([86, 43, 16]\) code and new extremal self-dual codes with weight enumerators which were not previously known to
Steven T. Dougherty, T. Aaron Gulliver, Masaaki Harada   +2 more
openaire   +1 more source

Self-dual extended cyclic codes

Applicable Algebra in Engineering, Communication and Computing, 2005
Using representation theoretical and number theoretical methods the authors investigate self-dual group codes and their extensions. The existence of a self-dual extended group code heavily depends on a particular structure of the group algebra which is defined by the number theoretic properties of the parameters of this algebra.
Conchita Martínez-Pérez, Wolfgang Willems   +1 more
openaire   +2 more sources

On Binary Self-Dual Codes With Automorphisms

IEEE Transactions on Information Theory, 2008
In this correspondence, we present some results concerning a decomposition of binary self-dual codes possessing an automorphism of certain type. Two applications are given. The first one is the classification of all extremal doubly even self-dual codes of length having an automorphism of order .
openaire   +1 more source

A note on self-dual group codes

IEEE Transactions on Information Theory, 2002
Summary: We classify group algebras over Galois rings containing self-dual ideals; i.e., ideals \(C\) which satisfy \(C= C^\perp\) with respect to the natural nondegenerate bilinear form given on group algebras.
openaire   +2 more sources

Self-dual codes from smaller lengths of self-dual codes and recursive algorithm

2013
Summary: 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

Self-dual Codes-Theme and Variations

2001
Self-dual codes over GF(2), GF(3) and GF(4) were classified from the early 70's until the early 80's. A method for how to do this and efficient descriptions of the codes were developed [3, 4, 17, 20, 21]. New results related to the binary classifications have recently appeared. New formats and classifications have also recently occurred.
openaire   +1 more source

Weighing matrices and self-dual codes

Ars Comb., 1997
A square \((0,-1,+1)\) matrix \(W\) is a {weighing matrix of weight} \(k\) if \(WW^T=kI\). This concept generalizes Hadamard matrices, as a weighing matrix of weight equal to its order is a Hadamard matrix, by generalizing the construction of \textit{V. D. Tonchev} [J. Comb. Theory, Ser. A 52, No.
openaire   +1 more source

The Automorphism Group of a Binary Self-Dual Doubly Even$[72,36,16]$Code is Solvable

IEEE Transactions on Information Theory, 2006
Stefka Bouyuklieva, Eamonn O'Brien
exaly  

The weight distribution of the self-dual $[128,64]$ polarity design code

Advances in Mathematics of Communications, 2016
Vladimir D Tonchev
exaly  

New binary quantum stabilizer codes from the binary extremal self-dual $$[48, 24, 12]$$ [ 48 , 24 , 12 ] code

Quantum Information Processing, 2015
Weiliang Wang, Yangyu Fan, Ruihu Li
exaly