Algebraic and Geometric Methods in Coding Theory
ACA 2022 Special Session
15-19 August 2022, Istanbul-Gebze, Turkey
Aims and Scope
Digital communication has never been so important as it is today. The design of error-correcting codes for the reliable transmission of information across noisy channels plays a crucial role in the modern era due to the massive overall communication traffic. To this aim, it has been necessary to develop sophisticated algebraic and geometric tools in order to construct codes that can correct as many error as possible in a very efficient way. Indeed, one of the first important class of codes has been obtained through the evaluation of certain polynomials over finite fields. Furthermore, geometric approaches to linear codes have been used to relate optimal codes with classical object in finite geometry.
This session is focused on the application of computer algebra to coding theory which, together with classical and new methods from algebra and geometry, can be used to obtain several and important results, such as construction of optimal codes, definition of efficient encoding and decoding algorithms and the study of algebraic, geometric and combinatorial problems arising from practical problems in coding theory.
Topics of the session include, but are not limited to:
Algebraic coding theory
Rank/sum-rank metric codes
Algebraic geometry codes
Quantum codes
Algebraic decoding algorithms
Combinatorial algorithms
Computational results
Related algebraic and combinatorial structures
Speakers
Gianira Alfarano (University of Zurich, Switzerland) - Critical problem, q-polymatroids and rank-metric codes
Zohreh Aliabadi (Sabanci University, Turkey) - On LCP of 1-generator QC codes
Anton Betten (Kuwait University, Kuwait) - Better CRC codes
Anurag Bishnoi (Delft University of Technology, the Netherlands) - Trifferent codes and affine blocking sets
Michela Ceria (Polytechnic University of Bari, Italy) - On the geometry of (q + 1)-arcs of PG(3, q), q even
Cem Guneri (Sabanci University, Turkey) - On optimal binary linear complementary pair of codes
Jaime Gutierrez (University of Cantabria, Spain) - Mutually Orthogonal Latin Squares based on e-Klenian polynomials
Relinde Jurrius (Netherlands Defence Academy, the Netherlands) - Constructions of new matroids and designs over Fq
Michel Lavrauw (Sabanci University, Turkey) - Computational classification of symplectic 4-dimensional semifields over finite fields
Lucia Moura (University of Ottawa, Canada) - Ordered covering arrays and NRT-metric covering codes
Daniel Panario (Carleton University, Canada) - Protograph-based LDPC codes with chordless short cycles and large minimum distance
Morgan Rodgers (Istinye University, Turkey) - Cameron–Liebler type sets and completely regular codes
Joachim Rosenthal (University of Zurich, Switzerland) - Construction of subspace codes using evaluation
John Sheekey (University College Dublin, Ireland) - Divisible codes and few-weight codes in the rank metric
Schedule
Tuesday (16 August 2022)
09:30 Michel Lavrauw
10:00 John Sheekey
10:30 Joachim Rosenthal
Wednesday (17 August 2022)
09:30 Daniel Panario
10:00 Lucia Moura
10:30 Anton Betten
break
11:30 Relinde Jurrius
12:00 Gianira Alfarano
lunch
14:00 Michela Ceria
14:30 Anurag Bishnoi
15:00 Morgan Rodgers
15:30 Jaime Gutierrez
break
16:30 Cem Guneri
17:00 Zohreh Aliabadi
Call for Contributions
If you are interested in presenting your recent work in this session, please send your title and abstract to both the session organizers, no later than May 30, 2022 June 9, 2022. Please use the available LaTeX template for your submission.
Organizers
Max Planck Institute for Mathematics in the Sciences (Leipzig, Germany)
alessandro.neri@mis.mpg.de
Università degli Studi della Campania "Luigi Vanvitelli" (Caserta, Italy)
ferdinando.zullo@unicampania.it