Self-dual codes over small prime fields from combinatorial designs

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we give some new extremal ternary self-dual codes which are constructed by skew-Hadamard matrices. This has been achieved with the aid of a recently presented modification of a known construction method. In addition, we survey the known results for self-dual codes over GF(5) constructed via combinatorial designs, i.e. Hadamard and skew-Hadamard matrices, and we give a new self-dual code of length 72 and dimension 36 whose minimum weight is 16 over GF(5) for the first time. Furthermore, we give some properties of the generated self-dual codes interpreted in terms of algebraic coding theory, such as the orders of their automorphism groups and the corresponding weight enumerators. © 2009 Springer.

Cite

CITATION STYLE

APA

Koukouvinos, C., & Simos, D. E. (2009). Self-dual codes over small prime fields from combinatorial designs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5725 LNCS, pp. 278–287). https://doi.org/10.1007/978-3-642-03564-7_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free