PROGRAM — SETA 2018 (01–06 OCTOBER 2018)

Monday 1 October

14:00–20:00 Registration

17:00–20:00 Reception

Tuesday 2 October

08:45–09:00 Conference opening

Plenary talk

9:00–10:00 Alexander Pott: Formal duality in finite abelian groups

Functions with low differential uniformity

10:00–10:30 Nikolay Kaleyski: Changing APN functions at two points

10:30–11:00 Coffee break

11:00–11:30 Nikolay Kaleyski, Lilya Budaghyan, Pantelimon Stanica, Constanza Riera and Soonhak Kwon: Partially APN boolean functions

11:30–12:00 Lilya Budaghyan, Marco Calderini, Claude Carlet, Robert Coulter and Irene Vil- la: On isotopic construction of APN functions

12:00–12:30 Pascale Charpin and Jie Peng: New links between nonlinearity and differential uni- formity

12:30–14:00 Lunch

Plenary talk

14:00–15:00 Raymond Yeung: Network Coding, Regeneration Codes, and Information-Theoretic Security

Autocorrelation of sequences

15:00–15:30 Yang Yang and Chunlei Li: A construction of quaternary sequences with optimal odd periodic autocorrelation magnitude

15:30–16:00 Coffee break

16:00–16:30 Evgeny Krengel: One construction of perfect ternary sequences

16:30–17:00 Chunlei Li and Yang Yang: On three conjectures of binary sequences with low odd- periodic autocorrelation

17:00–17:30 Anatolii Leukhin, Vladimir Bezrodnyi and Nikolai Parsaev: Unimodular sequences with good aperiodic autocorrelation

17:30–18:00 Min Kyu Song and Hong-Yeop Song: A generalized Milewski construction for perfect sequences


Wednesday 3 October

Plenary talk

9:00–10:00 Sihem Mesnager: On hyper-bent and generalized hyper-bent functions

Coding theory I

10:00–10:30 Xiwang Cao, Gaojun Luo and Guangkui Xu: Three deterministic constructions of compressed sensing matrices with low coherence

10:30–11:00 Coffee break

11:00–11:30 Malcolm Egan: On regular schemes and tight frames

11:30–12:00 Minjia Shi and Patrick Sole: A new class of MDS codes for the pair weight

12:00–12:30 Krishna Gopal Benerjee and Manish Kumar Gupta: On universally good flower codes

12:30–14:00 Lunch

Sequences for new applications

14:00–14:30 Fang Liu, Kenneth Shum and Wing Shing Wong: Schedule sequence design for broadcast in multi-channel Ad Hoc networks

14:30–15:00 Domingo Gomez and Andrew Tirkel: Large families of sequences for cdma, frequency hopping and UWB

15:00–15:30 Ahmad Sabri: On the increasing generalized ballot sequences and algorithmic consid- erations

15:30–16:00 Coffee break

16:00–16:30 Xing Liu, Liang Zhou, Qi Zeng and Limengnan Zhou: Control sequences for access mechanism of data link

Complementary sequence sets

16:30–17:00 Shibsankar Das, Sudhan Majhi and Palash Sarkar: An improved multiplier-free gen- erator for polyphase complete complementary codes

17:00–17:30 Yajing Zhou, Zhengchun Zhou, Yang Yang and Yong Wang: Two constructions for 16-QAM complementary sequence sets with non-power-of-two length

17:30–18:00 Sam Blake and Andrew Tirkel: Array orthogonality in higher dimensions

Thursday 4 October

Plenary talk

9:00–10:00 Kai-Uwe Schmidt: Boolean functions with large nonlinearity


Nonlinear feedback shift register sequences

10:00–10:30 Ge Yao and Udaya Parampalli: Transformation algorithm for NLFSRs in hardware oriented stream ciphers

10:30–11:00 Coffee break

11:00–11:30 Xiaofang Wang, Dennis Wong and Weiguo Zhang: A simple greedy de Bruijn se- quence construction

Cross correlation

11:30–12:00 Dan Zhang, Matthew Geoffrey Parker and Tor Helleseth: Multiple optimal ZCZ sequence sets with good inter-set cross-correlation based on generalised bent functions

12:00–12:30 Wenxia Duan and Jinquan Luo: Binary sequences of different periods with low cross correlations

12:30–14:00 Lunch


Free time



Friday 5 October

Plenary talk

9:00–10:00 Lingfei Jin (On behalf of Chaoping Xing): Sequences via automorphisms of func- tion fields

Coding theory II

10:00–10:30 Deng Tang, Xia Li and Bing Liu: A note on the minimal binary linear code

10:30–11:00 Coffee break

11:00–11:30 Minjia Shi, Chengchen Wang, Rongsheng Wu, Yu Hu and Yaoqiang Chang: One- weight and two-weight Z2Z2[u; v]-additive codes

11:30–12:00 Xia Li, Cuiling Fan and Xiaoni Du: A family of distance-optimal minimal linear codes

Frequency hopping sequences I

12:00–12:30 Hongyu Han, Sheng Zhang, Limengnan Zhou and Xing Liu: Design of low hit zone frequency-hopping sequence sets with optimal partial Hamming correlation based on decimated m-sequences

12:30–14:00 Lunch

Cryptographical functions

14:00–14:30 Fuad Hamidli and Ferruh Ozbudak: On Alltop functions

14:30–15:00 Zilong Wang, Jinjin Chai and Guang Gong: The fourier spectral characterization for the correlation-Immune functions over Fp


Linear complexity

15:00–15:30 Zhimin Sun, Xiangyong Zeng and Da Lin: On the Nth maximum order complexity of the Rudin-Shapiro-like sequence

15:30–16:00 Coffee break

16:00–16:30 Yuhua Sun, Tongjiang Yan and Zhixiong Chen: The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude

Banquet and Honorary talk at Banquet

17:10–20:45 Banquet (Shuttle bus arrangement to be announced)

18:30–18:45 Tor Helleseth: Memorable moments of the past SETAs

Saturday 6 October

Exponential sums and their applications

9:00–9:30 Chunming Tang, Yanfeng Qi and Dongmei Huang: Regular p-ary bent functions with five terms and Kloosterman sums

9:30–10:00 Chengju Li, Qin Yue and Yongbo Xia: A class of exponential sums and sequence families

10:00–10:30 Yansheng Wu, Qin Yue, Xueying Shi and Xiaomeng Zhu: Binary and ternary se- quences with a few cross correlations

10:30–11:00 Coffee break

Cyclic codes and sequences

11:00–11:30 Limengnan Zhou, Hongyu Han and Xing Liu: Frequency-hopping sequence sets with no-hit-zone through Cartesian product

11:30–12:00 Liqin Qian and Minjia Shi: Cyclic DNA codes over the local Frobenius non-chain rings of order 16

12:00–12:30 Srikanth Cherukupally: Certain sequences of arithmetic progressions and a crypto- graphic application

12:30–14:00 Lunch