Classification of extremal and $s$-extremal binary self-dual codes of length 38

نویسندگان

  • Carlos Aguilar Melchor
  • Philippe Gaborit
  • Jon-Lark Kim
  • Lin Sok
  • Patrick Solé
چکیده

Abstract—In this paper we classify all extremal and s-extremal binary self-dual codes of length 38. There are exactly 2744 extremal [38, 19, 8] self-dual codes, two s-extremal [38, 19, 6] codes, and 1730 s-extremal [38, 19, 8] codes. We obtain our results from the use of a recursive algorithm used in the recent classification of all extremal self-dual codes of length 36, and from a generalization of this recursive algorithm for the shadow. The classification of s-extremal [38, 19, 6] codes permits to achieve the classification of all s-extremal codes with d = 6.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classification of Extremal and -Extremal Binary Self-Dual Codes of Length 38

In this paper we classify all extremal and -extremal binary self-dual codes of length 38. There are exactly 2744 extremal self-dual codes, two -extremal codes, and 1730 -extremal codes. We obtain our results from the use of a recursive algorithm used in the recent classification of all extremal self-dual codes of length 36, and from a generalization of this recursive algorithm for the shadow. T...

متن کامل

N ov 2 01 2 A complete classification of doubly even self - dual codes of length 40 ∗

A complete classification of binary doubly even self-dual codes of length 40 is given. As a consequence, a classification of binary extremal self-dual codes of length 38 is also given. ∗This work was supported by JST PRESTO program.

متن کامل

A Complete Classification of Doubly Even Self-dual Codes of Length 40

A complete classification of binary doubly even self-dual codes of length 40 is given. As a consequence, a classification of binary extremal self-dual codes of length 38 is also given. ∗This work was supported by JST PRESTO program.

متن کامل

Binary s - extremal self - dual codes of length 68 do exist 1

We study binary self-dual codes with an automorphism of order 7 and minimum distance 12 or 14 for lengths 64 ≤ n ≤ 70. A classification of all codes of length 9 over the set P of all even-weight polynomials in F2[x]/〈x − 1〉 such that the minimum distance of the binary projection is at least 12, is proven. Using one particular such code we have constructed six inequivalent s-extremal binary self...

متن کامل

Upper Bounds for the length of s - Extremal Codes over F 2 , F 4 , and F 2 + u F 2

Our purpose is to find an upper bound for the length of s-extremal codes over F2 (resp. F4) when d ≡ 2 (mod 4) (resp. d odd). This question is left open in [6], [2]. More precisely, we show that there is no s-extremal binary code of length n ≥ 21d− 82 if d > 6 and d ≡ 2 (mod 4). Similarly we show that there is no s-extremal additive F4 code of length n ≥ 13d− 26 if d > 1 and d is odd. We also d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 58  شماره 

صفحات  -

تاریخ انتشار 2012