Results 251 to 260 of about 377,588 (277)

A systematic construction of self-dual codes

IEEE Transactions on Information Theory, 2003
A new coding construction scheme of block codes using short base codes and permutations that enables the construction of binary self-dual codes is presented in Cadic et al. (2001) and Carlach et al. (1999, 2000). The scheme leads to doubly-even (resp,. singly-even) self-dual codes provided the base code is a doubly-even self-dual code and the number of
Jean-Claude Carlach, Ayoub Otmani
openaire   +1 more source

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

MDS or NMDS self-dual codes from twisted generalized Reed–Solomon codes

Designs, Codes, and Cryptography, 2021
Qin Yue, Yongfeng Niu
exaly  

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

A Unified Approach to Construct MDS Self-Dual Codes via Reed-Solomon Codes

IEEE Transactions on Information Theory, 2020
Aixian Zhang, Keqin Feng
exaly  

On the classification and enumeration of self-dual codes

Finite Fields and Their Applications, 2005
W Cary Huffman
exaly  

Extremal binary self-dual codes

IEEE Transactions on Information Theory, 1997
S T Dougherty, T Aaron Gulliver
exaly