Symmetries of weight enumerators

Similar documents
Symmetries of Weight Enumerators

Open Questions in Coding Theory

Self-Dual Cyclic Codes

On Extremal Codes With Automorphisms

7.1 Definitions and Generator Polynomials

Formally self-dual additive codes over F 4

On the Nonexistence of Perfect 2- and 3-Hamming-Error-Correcting Codes over GF(q)

Local behaviour of Galois representations

Ring of the weight enumerators of d + n

CYCLIC SIEVING FOR CYCLIC CODES

An Extremal Doubly Even Self-Dual Code of Length 112

Solutions of Exam Coding Theory (2MMC30), 23 June (1.a) Consider the 4 4 matrices as words in F 16

: Error Correcting Codes. November 2017 Lecture 2

1. Examples. We did most of the following in class in passing. Now compile all that data.

Extended Binary Linear Codes from Legendre Sequences

Finite geometry codes, generalized Hadamard matrices, and Hamada and Assmus conjectures p. 1/2

ON THE INTEGRAL RING SPANNED BY GENUS TWO WEIGHT ENUMERATORS. Manabu Oura

Double Circulant Codes over Z 4 and Even Unimodular Lattices

: Error Correcting Codes. October 2017 Lecture 1

MATH32031: Coding Theory Part 15: Summary

Codes and Rings: Theory and Practice

Automorphism groups of self-dual binary linear codes

The Hamming Codes and Delsarte s Linear Programming Bound

The MacWilliams Identities

Elementary 2-Group Character Codes. Abstract. In this correspondence we describe a class of codes over GF (q),

On Divisible Codes over Finite Fields

Revista Integración ISSN: X Universidad Industrial de Santander Colombia

ALGEBRA QUALIFYING EXAM SPRING 2012

For example, p12q p2x 1 x 2 ` 5x 2 x 2 3 q 2x 2 x 1 ` 5x 1 x 2 3. (a) Let p 12x 5 1x 7 2x 4 18x 6 2x 3 ` 11x 1 x 2 x 3 x 4,

Orthogonal Arrays & Codes

Type I Codes over GF(4)

Automorphisms of doubly-even self-dual binary codes.

Subcodes of the Projective Generalized Reed-Muller Codes Spanned by Minimum-Weight Vectors

Open problems on cyclic codes

Decomposing Bent Functions

Great Theoretical Ideas in Computer Science

Self-dual codes and invariant theory 1

Support weight enumerators and coset weight distributions of isodual codes

G Solution (10 points) Using elementary row operations, we transform the original generator matrix as follows.

Construction of quasi-cyclic self-dual codes

Unsolved Problems in Graph Theory Arising from the Study of Codes*

q-de Rham cohomology via Λ-rings

MATH3302 Coding Theory Problem Set The following ISBN was received with a smudge. What is the missing digit? x9139 9

Cover Page. The handle holds various files of this Leiden University dissertation

A Projection Decoding of a Binary Extremal Self-Dual Code of Length 40

Interesting Examples on Maximal Irreducible Goppa Codes

Combinatória e Teoria de Códigos Exercises from the notes. Chapter 1

Dr. Marques Sophie Algebra 1 Spring Semester 2017 Problem Set 9

Linear Cyclic Codes. Polynomial Word 1 + x + x x 4 + x 5 + x x + x f(x) = q(x)h(x) + r(x),

We saw in the last chapter that the linear Hamming codes are nontrivial perfect codes.

Codes over Subfields. Chapter Basics

Codes and invariant theory.

Construction of a (64, 2 37, 12) Code via Galois Rings

Group Theory. 1. Show that Φ maps a conjugacy class of G into a conjugacy class of G.

Subrings and Ideals 2.1 INTRODUCTION 2.2 SUBRING

Partial permutation decoding for binary linear Hadamard codes

arxiv: v2 [math.ca] 13 May 2015

3. Coding theory 3.1. Basic concepts

On Weight Distributions of Homogeneous Metric Spaces Over GF (p m ) and MacWilliams Identity

Algebraic structures I

Algebraic Characterization of Minimum Weight Codewords of Cyclic Codes

Assessment Exemplars: Polynomials, Radical and Rational Functions & Equations

Computing Error Distance of Reed-Solomon Codes

NOTES WEEK 04 DAY 1 SCOT ADAMS

On Ternary Self-Dual Codes of Length 24

Cyclic codes. I give an example of a shift register with four storage elements and two binary adders.

Umbral groups. Robert A. Wilson. LMS EPSRC Durham Symposium, 4th August 2015

ON LINEAR CODES WHOSE WEIGHTS AND LENGTH HAVE A COMMON DIVISOR. 1. Introduction

x n k m(x) ) Codewords can be characterized by (and errors detected by): c(x) mod g(x) = 0 c(x)h(x) = 0 mod (x n 1)

A Generalization of Wilson s Theorem

5.0 BCH and Reed-Solomon Codes 5.1 Introduction

arxiv:math/ v1 [math.co] 1 Aug 2002 May

Construction X for quantum error-correcting codes

Traces of rationality of Darmon points

Error Correcting Codes Questions Pool

Recursive constructions of irreducible polynomials over finite fields

Coding Theory as Pure Mathematics

: Coding Theory. Notes by Assoc. Prof. Dr. Patanee Udomkavanich October 30, upattane

Lecture 17: Perfect Codes and Gilbert-Varshamov Bound

Skew Cyclic Codes Of Arbitrary Length

ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008

New Families of Triple Error Correcting Codes with BCH Parameters

Arrangements, matroids and codes

Rings and modular arithmetic

Strongly regular graphs constructed from groups

Chapter 6 Reed-Solomon Codes. 6.1 Finite Field Algebra 6.2 Reed-Solomon Codes 6.3 Syndrome Based Decoding 6.4 Curve-Fitting Based Decoding

Binary construction of quantum codes of minimum distances five and six

Proof: Suppose not. By compactness we want to construct an indiscernible sequence xc i : i P Qy such that for any r P RzQ, the ϕ-type

Rational Point Counts for del Pezzo Surfaces over Finite Fields and Coding Theory. A dissertation presented. Nathan Kaplan

The primitive root theorem

The commutation with ternary sets of words

Non-Standard Coding Theory

Symmetries of a q-ary Hamming Code

The average dimension of the hull of cyclic codes

Properties of Trace Maps and their Applications to Coding Theory. N. Pinnawala. Doctor of Philosophy RMIT

Polynomials 6c Classifying the Zeros of a Polynomial Functions

B. Cyclic Codes. Primitive polynomials are the generator polynomials of cyclic codes.

Definitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch

Extending and lengthening BCH-codes

Lecture 2 Linear Codes

Transcription:

Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 0 / 13 Symmetries of weight enumerators Martino Borello Université Paris 8 - LAGA Fq13

Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 1 / 13 Introduction Introduction One of the most remarkable theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes. N. Sloane Properties of codes (or of families of codes) c c ú Symmetries of their weight enumerators M. Borello, O. Mila. On the Stabilizer of Weight Enumerators of Linear Codes. arxiv:1511.00803.

Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 2 / 13 Background Background q a prime power. A q-ary linear code C of length n is a subspace of F n q. If c pc 1,..., c n q P C (codeword), the (Hamming) weight of c is wtpcq : #ti P t1,..., nu c i 0u (wtpcq : twtpcq c P Cu). If C C K, the code C is called self-dual. C F n q ù w C px, yq : cpc x n wtpcq y wtpcq ņ i0 A i x n i y i with A i : #tc P C wtpcq iu (weight enumerator of C).

Background Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 3 / 13 C binary linear code. Divisibility conditions Even: wtpcq 2Z ñ w C px, yq w C px, yq. Doubly-even: wtpcq 4Z ñ w C px, yq w C px, iyq. MacWilliams' identities Self-dual ñ w C px, yq w x y C? Group action GL 2 pcq ý Crx, ys: ppx, yq a b c d, x y? 2 2. For G GL 2 pcq, the invariant ring of G is : ppax by, cx dyq. Crx, ys G : tppx, yq ppx, yq A ppx, yq @A P Gu. Notation: for ppx, yq P Crx, ys, Spppx, yqq : Stab GL2pCqpppx, yqq.

Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 4 / 13 Gleason's Theorem Gleason's Theorem Theorem (Gleason '70) Let C be a binary linear code which is self-dual and doubly-even. Then w C px, yq P Crf 1, f 2 s where f 1 : wĥ3 px, yq and f 2 : w G24 px, yq. C self-dual ñ w C px, yq w x y C?, x y? 2 2 C doubly-even ñ w C px, yq w C px, iyq, B F 1 1 1 1 0 G :?, ñ Crx, ys 2 1 1 0 i G Crf 1, f 2 s.,

Gleason's Theorem Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 5 / 13 C F n 2 self-dual and doubly-even. Consequences 8 n (Gleason '71). dpcq 4 X n 24 \ 4 (Mallows and Sloane '73). If the bound is achieved C is called extremal. extremal and doubly-even ñ n 3928 (Zhang '99). Is there an extremal self-dual code of length 72? 24 looooooooooomooooooooooon n and extremal (Sloane '73). ó all codewords of given weight support a 5-design (Assmus and Mattson '69)

Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 6 / 13 Questions Questions Many generalization of Gleason's theorem. G. Nebe, E.M. Rains, N.J.A. Sloane. Self-dual codes and invariant theory. Vol. 17. Berlin: Springer, 2006. What if MacWilliams' identities do not give a symmetry? Our questions Which are the possible groups of symmetries? Given a weight enumerator of a code, which are its symmetries? Are they shared by the whole family of this code? Can we determine with these methods unknown weight enumerators?

Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 7 / 13 Possible symmetries Possible symmetries For ppx, yq P Crx, ys h (h=homogeneous), denote V pppx, yqq : tpx : yq P P 1 pcq ppx, yq 0u. π : Spppx, yqq GL 2 pcq ÞÑ Spppx, yqq PGL 2 pcq. induces a b, px : yq c d Theorem (B.,Mila) PGL 2 pcq ÞÑ Spppx, yqq ý P 1 pcq pax by : cx dyq V pppx, yqq. ý simply 3-transitive #Spppx, yqq 8 ô #V pppx, yqq 3.

Possible symmetries Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 8 / 13 Theorem (Blichfeldt 1917) If H PGL 2 pcq is nite, then H is conjugate to one of the following: @ 1 0 0 ζ m D Cm for a certain m P N. @ 1 0 @ 1 0 0 1, i i D 1 1 A4. 0 ζ m, r 0 1 sd D 1 0 m for a certain m P N. @ r 1 0 0 i s, i i @ 1 0 0 1 Corollary D 1 1 S4., i i 1 1, 2 ω ω 2 D A5 where ω p1? 5qi p1? 5q. If #V pppx, yqq 3, then DA P GL 2 pcq s.t. Spppx, yqq A is a central extension of one of the groups listed above.

Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 9 / 13 The algorithm The algorithm Input: ppx, yq P Crx, ys h of degree n s.t. pp1, 0q 0. 1. G : H. 2. V :RootsOfpppx, 1qq tx 1,..., x m u. 3. If m 3, then print(innite group) and break; else V 3 : tall ordered 3-subsets of V u. 4. For tx 1, x 1, x 1 u P V 1 2 3 3: $ & x 1a b x1x 1 1c x1d 1 0 4a. Solve x 2a b x2x 1 2c x2d 1 0 (the unknowns are a, b, c, d). % x 3a b x3x 1 3c x3d 1 0 Call! a, b, c, d one ) of the 8 1 solutions. (simply 3-transitive) ax b 4b. If cx d x P V V, then a b 4bi. A : c d. 4bii. λ : ppa,cq pp1,0q. B : λ 1{n A. (to x the polynomial, not only the roots) 4biii. If ppx, y q B ppx, y q, then G : G Y tζ nb ζ n P C s.t. ζ n n 1u. Output: G Spppx, yqq.

Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 9 / 13 The algorithm The algorithm Input: ppx, yq P Crx, ys h of degree n s.t. pp1, 0q 0. 1. G : H. 2. V :RootsOfpppx, 1qq tx 1,..., x m u. (Where?) 3. If m 3, then print(innite group) and break; else V 3 : tall ordered 3-subsets of V u. (#V 3 m 3 3m 2 2m) 4. For tx 1, x 1, x 1 u P V 1 2 3 3: $ & x 1a b x1x 1 1c x1d 1 0 4a. Solve x 2a b x2x 1 2c x2d 1 0 (the unknowns are a, b, c, d). % x 3a b x3x 1 3c x3d 1 0 Call! a, b, c, d one ) of the 8 1 solutions. (simply 3-transitive) ax b 4b. If cx d x P V V, then a b 4bi. A : c d. 4bii. λ : ppa,cq pp1,0q. B : λ 1{n A. (to x the polynomial, not only the roots) 4biii. If ppx, y q B ppx, y q, then G : G Y tζ nb ζ n P C s.t. ζ n n 1u. Output: G Spppx, yqq.

Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 10 / 13 Reed-Muller codes Reed-Muller codes RM q pr, mq : tpf paqq apf m q Dimension and minimum distance known. Weight enumerator of a RM q pr, mq code f P F q rx 1,..., x m s of degree ru F qn q. c c ú Counting F q-rational points of hypersurfaces in A m pf q q N. Kaplan. Rational Point Counts for del Pezzo Surfaces over Finite Fields and Coding Theory. 2013. Thesis (Ph.D.) - Harvard University

Reed-Muller codes Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 11 / 13 Remark RM 2 pr, 2r 1q self-dual and doubly-even ñ Spw RM2pr,2r 1qpx, yqq S 4. Theorem (B.,Mila) If one of the following holds q 2 and m 3r 1, q P t3, 4, 5u and m 2r 1, q 5 and m r 1, then Spw RMqpr,mqpx, yqq and Spw RMqpmpq 1q r 1,mqpx, yqq are cyclic or dihedral. Theorem (B.,Mila) Spw RM4p1,1qpx, yqq A 3? 15 6 2? 15? 4 15 3 E 1 3, 1 1 V 4 so that w RM4p1,1qpx, yq P Crf 1, f 2 s, where f 1 : 2x 2?? p3 15qxy p3 15qy 2, f 2 : 53x 4 36x 3 y 18x 2 y 2 636xy 3 213y 4.

Reed-Muller codes Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 12 / 13 Table: Spw RM2 pr,mqpx, yqq m r 1 2 3 4 5 6 7 0 8 D 4 D 8 D 16 D 32 D 64 D 128 1 8 D 4 S 4 D 8 D 16 D 32 D 64 2 8 8 D 8 D 8 S 4 D 4 D 8 3 8 8 8 D 16 D 16 D 4 S 4 4 8 8 8 8 D 32 D 32 D 8 5 8 8 8 8 8 D 64 D 64 6 8 8 8 8 8 8 D 128

Reed-Muller codes Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 13 / 13 Table: Spw RM3 pr,mqpx, yqq m r 1 2 3 4 0 D 3 D 9 D 27 D 81 1 D 3 C 3 C 9 C 27 2 8 C 3 C 3 C 3 3 8 D 9 C 3? 4 8 8 C 9? 5 8 8 D 27 C 3 6 8 8 8 C 27 7 8 8 8 D 81 Table: Spw RM4 pr,mqpx, yqq m r 1 2 3 0 D 8 D 16 D 64 1 V 4 C 4 C 16 2 D 8 tidu C 4 3 8 tidu tidu 4 8 C 4? 5 8 D 16 tidu 6 8 8 C 4 7 8 8 C 16 8 8 8 D 64 Open problem Understand the general behavior and deduce properties and new weight enumerators.

Thanks Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 13 / 13 Thank you very much for the attention!

Appendix A At most two roots C F n q s.t. #V pw Cpx, yqq 3. Theorem (B.,Mila) One of the following holds: C t0u; C F n q ; n is even and C is equivalent to n{2 à i1 r1, 1s; n is even, q 2 and w C px, yq px 2 y 2 q n{2. Open problem Is it possible to classify all the binary codes of even length n with weight enumerator px 2 y 2 q n{2? Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 13 / 13

Appendix A Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 13 / 13 M : tbinary codes of length n and weight enumerator px 2 y 2 q n{2 n P 2Nu{, Lemma pm, `q is a semigroup. the r2, 1, 2s code X 1 with generator matrix r1, 1s; the r6, 3, 2s code X 2 with generator matrix ; 1 0 0 1 1 1 0 1 0 1 1 1 0 0 1 1 1 1 three r14, 7, 2s codes, X 3, X 4 and X 5, with generator matrices ri X 3 s,ri X 4 s and ri X 5 s respectively, where X 3 : 1 1 1 0 0 0 0 1 1 1 0 0 0 0 1 1 1 0 0 0 0 1 0 0 1 1 1 1 1 0 0 1 1 1 1 1 0 0 1 1 1 1 1 0 0 0 0 0 0, X 4 : and I is the 7 7 identity matrix. 1 1 1 1 1 0 0 1 1 1 1 1 0 0 1 1 1 1 1 0 0 1 1 1 1 1 0 0 1 1 1 1 0 1 0 1 1 1 1 0 1 0 1 1 1 1 1 1 1 Minimal set of generators? Innitely many?, X 5 : 1 0 1 0 1 0 0 1 0 1 0 1 0 0 1 0 1 0 1 0 0 1 0 1 0 1 0 0 1 1 1 0 1 0 1 1 1 1 0 1 0 1 1 1 1 1 1 1 1

Appendix B Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 13 / 13 Another open problem Examples rn, 1, ns repetition code with n 3: w C px, yq x n y ù n Spw C px, yqq D n. r12, 6, 6s 3 ternary Golay code: w C px, yq x 12 264x 6 y 6 440x 3 y 9 24y ù 12 Spw C px, yqq A 4. r8, 4, 4s extended Hamming code: w C px, yq x 8 14x 4 y 4 y ù 8 Spw C px, yqq S 4. Open problem Is there a code C such that Spw C px, yqq A 5?

2024 © sciencedocbox.com Privacy Policy | Terms of Service | Feedback