Seminar: PD-sets for partial permutation decoding of Z2s -linear Hadamard codes

PD-sets for partial permutation decoding of Z2s -linear Hadamard codes

Merce Villanueva,

Autonomous University of Barcelona

Date: Thursday 5th September
Time: 1:00pm–2:00pm (Talk & Q/A)
Venue: Building 8 Level 9 Room 66 (AGR) RMIT City campus

The seminar will be followed by snacks and drinks
All students, staff and visitors are welcome

ABSTRACT:
Let Z2s be the ring of integers modulo 2s with s≥1, and let Z2sn be the set of
n-tuples over Z2s. A nonempty subset C of Z2sn is a Z2s-additive code if C is a subgroup of Z2sn. Note that, when s=1, C is a binary linear code; and when s=2, it is a quaternary linear code or a linear code over Z4.
The Z2s-additive codes can be seen as binary codes (not necessarily linear) under a generalization of the usual Gray map, Φ:Z2sn⇒Z2n2s-1. The binary image C=Φ(C) is a Z2s-linear code of length n2s-1. Permutation decoding is a technique, first introduced for linear codes, that involves finding a special subset, called a PD-set, of the automorphism group of a code. In 2015, a new permutation decoding method for Z4-linear codes and, in general, for systematic codes (not necessarily linear) was introduced, but the determination of PD-sets for nonlinear codes remained an open problem. In 2018, s-PD-sets of minimum size s+1 for some families of nonlinear systematic codes such as Z4-linear Hadamard, Kerdock and simplex codes were given. We will show the generalization of some of these results to the family of Z2s-linear Hadamard codes.

BIOGRAPHY: Mercè Villanueva was born in Roses, Catalonia, in January 1972. She received the B.Sc. degree in Mathematics in 1994 from the Autonomous University of Barcelona, the M.Sc. degree in Computer Science in 1996, and the Ph.D. degree in Science (Computer Science Section) in 2001 from the same university. In 1994 she joined the Department of Information and Communications Engineering, at the Autonomous University of Barcelona, as an Assistant Professor, and was promoted to Associate Professor in 2002. Her research interests include subjects related to combinatorics, algebra, coding theory, and graph theory.