Results 231 to 240 of about 645,715 (278)
Some of the next articles are maybe not open access.
SIAM Journal on Discrete Mathematics, 1994
Summary: The authors present a construction of binary self-dual codes from Eulerian graphs and establish that the code will be indecomposable if and only if the vertices of degree 2 are not a cutset of the graph. The construction is used to establish that every finite group is isomorphic to the automorphism group of some self-dual code.
László Babai +2 more
openaire +1 more source
Summary: The authors present a construction of binary self-dual codes from Eulerian graphs and establish that the code will be indecomposable if and only if the vertices of degree 2 are not a cutset of the graph. The construction is used to establish that every finite group is isomorphic to the automorphism group of some self-dual code.
László Babai +2 more
openaire +1 more source
Applicable Algebra in Engineering, Communication and Computing, 2020
In this paper, the authors define a self-dual code over a finite abelian group in terms of an arbitrary duality on the ambient space. They determine when additive self-dual codes exist over abelian groups for any duality and describe various constructions for these codes.
Steven T. Dougherty +2 more
openaire +2 more sources
In this paper, the authors define a self-dual code over a finite abelian group in terms of an arbitrary duality on the ambient space. They determine when additive self-dual codes exist over abelian groups for any duality and describe various constructions for these codes.
Steven T. Dougherty +2 more
openaire +2 more sources
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
In this paper we develop a complete generalization of the building-up method [J.-L. Kim, (2001)] for the Euclidean and Hermitian self-dual codes over finite fields GF(q). Using this method we construct many new Euclidean and Hermitian self-dual MDS (or near MDS) codes of length up to 12 over various finite fields GF(q), where q=8, 9, 16, 25, 32, 41, 49,
Jon-Lark Kim, Yoonjin Lee
openaire +1 more source
In this paper we develop a complete generalization of the building-up method [J.-L. Kim, (2001)] for the Euclidean and Hermitian self-dual codes over finite fields GF(q). Using this method we construct many new Euclidean and Hermitian self-dual MDS (or near MDS) codes of length up to 12 over various finite fields GF(q), where q=8, 9, 16, 25, 32, 41, 49,
Jon-Lark Kim, Yoonjin Lee
openaire +1 more source
Construction of Self-Dual Codes
IEEE Transactions on Information Theory, 2008Construction methods for self-dual codes are given. By using these methods some new extremal self-dual [66, 33, 12] and [68, 34, 12] codes are obtained.
Han-Ping Tsai +4 more
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
Neil J. A. Sloane, John G. Thompson 0001
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
Neil J. A. Sloane, John G. Thompson 0001
openaire +2 more sources
2008 IEEE International Symposium on Information Theory, 2008
We consider the problem for which lengths a self-dual MDS code over Fq exists.We show that for q = 2m, there are self-dual MDS codes for all even lengths up to 2m. Furthermore, self-dual MDS codes of length q + 1 over Fq exist for all odd prime powers q. Additionally, we present some new self-dual MDS codes.
Markus Grassl, T. Aaron Gulliver
openaire +1 more source
We consider the problem for which lengths a self-dual MDS code over Fq exists.We show that for q = 2m, there are self-dual MDS codes for all even lengths up to 2m. Furthermore, self-dual MDS codes of length q + 1 over Fq exist for all odd prime powers q. Additionally, we present some new self-dual MDS codes.
Markus Grassl, T. Aaron Gulliver
openaire +1 more source
Constructions of self-dual codes and formally self-dual codes over rings
Applicable Algebra in Engineering, Communication and Computing, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Steven T. Dougherty +2 more
openaire +1 more source
On the Classification of Self-dual -Codes
2009A classification of self-dual -codes of modest lengths is known for small k . For k = 4,6,8,9 and 10, the classification of self-dual -codes is extended to lengths 19,12,12,12 and 10, respectively, by considering k -frames of unimodular lattices.
Masaaki Harada, Akihiro Munemasa
openaire +1 more source