On the minimal distance of binary self-dual cyclic codes

Authors:
Bas Heijne;Jaap Top
Affiliations:
Department of Mathematics and Computer Science, University of Groningen, Groningen, The Netherlands;Department of Mathematics and Computer Science, University of Groningen, Groningen, The Netherlands
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 6
Cited 0

Coding and information theory

Coding and information theory
Handbook of Coding Theory

Handbook of Coding Theory
Self-Dual Codes and Invariant Theory (Algorithms and Computation in Mathematics)

Self-Dual Codes and Invariant Theory (Algorithms and Computation in Mathematics)
Construction of an extremal self-dual code of length 62

IEEE Transactions on Information Theory
Weight distributions of cyclic self-dual codes

IEEE Transactions on Information Theory
Transitive and self-dual codes attaining the Tsfasman-Vla˘dut$80-Zink bound

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

Visualization

Abstract

-In this paper, an explicit construction of binary self-dual cyclic codes of length n going to infinity with a minimal distance at least half the square root of n is presented. The same idea is also used to construct more general binary cyclic codes with a large minimal distance. Finally, in the special case of self-dual cyclic codes, a simplified version of a proof by Conway and Sloane is given, showing an upper bound for the distance of binary self-dual codes.