On self-dual codes over some prime fields

Authors:
Koichi Betsumiya;Stelios Georgiou;T. Aaron Gulliver;Masaaki Harada;Christos KouKouvinos
Affiliations:
Graduate School of Mathematics, Nagoya University, Nagoya 464-8602, Japan;Department of Mathematics, National Technical University of Athens, Zografou 15773, Athens, Greece;Department of Electrical and Computer Engineering, University of Victoria, P.O. Box 3055, STN CSC, Victoria, BC, Canada V8W 3P6;Department of Mathematical Sciences, Yamagata University, Yamagata 990-8560, Japan;Department of Mathematics, National Technical University of Athens, Zografou 15773, Athens, Greece
Venue:
Discrete Mathematics
Year:
2003

Citing 6
Cited 8

Self-dual codes over GF(7)

IEEE Transactions on Information Theory
Almost MDS Codes

Designs, Codes and Cryptography
Classical arcs in PG(r,q) for 11 ≤ q≤19

Proceedings of the international conference on Combinatorics '94
Handbook of Coding Theory

Handbook of Coding Theory
Orthogonal Designs and Type II Codes over \Bbb{Z}_{2k}

Designs, Codes and Cryptography
Self-dual codes over Fp and weighing matrices

IEEE Transactions on Information Theory

Euclidean and hermitian self-dual MDS codes over large finite fields

Journal of Combinatorial Theory Series A
Self-Orthogonal and Self-Dual Codes Constructed via Combinatorial Designs and Diophantine Equations

Designs, Codes and Cryptography
MDS self-dual codes of lengths 16 and 18

International Journal of Information and Coding Theory
New MDS self-dual codes over finite fields

Designs, Codes and Cryptography
Quasi-Cyclic codes over

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
MDS Self-Dual Codes over Large Prime Fields

Finite Fields and Their Applications
Self-dual codes from circulant matrices

Designs, Codes and Cryptography
Quasi-cyclic codes over F13 and enumeration of defining polynomials

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.05

Visualization

Abstract

In this paper, we study self-dual codes over GF(p) where p = 11, 13, 17, 19, 23 and 29. A classification of such codes for small lengths is given. The largest minimum weights of these codes are investigated. Many maximum distance separable self-dual codes are constructed.