SS13 - Advances in Coding Theory: Algebraic, Combinatorial and Computational Methods

link to the session's webpage

This special session will focus on the interplay between coding theory with special emphasis on algebraic, combinatorial, and computational methods. These include the exploration of algebraic and geometric methods for special classes of codes such as algebraic geometry codes, rank-metric codes, additive codes, and codes with automorphisms. Techniques from Delsarte and Levenshtein for code families and related combinatorial structures will also be explored. Additionally, the session will focus on computer algebra methods for determining the parameters of codes and related combinatorial structures.

Session organizers

Peter Boyvalenkov (Bulgarian Academy of Sciences, Bulgaria)

Cem Güneri (Sabanci University, Turkey)

Ferruh Özbudak (Sabanci University, Turkey)

Talks

Daniel Panario - Girth Analysis of Quantum Quasi-Cyclic LDPC Codes

Buket Özkaya - Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes

Burcu Gülmez Temür - On the complete characterization of a class of permutation trinomials in characteristic five

Chiara Castello - Some constructions of asymptotically optimal cyclic subspace codes

Giovanni Longobardi - Scattered trinomials of F_{q^6}[X] in even characteristic

Iliya Bouyukliev - Graph isomorphism and isomorphism of binary matrices

Mariya Dzhumalieva-Stoeva - Enumeration of optimal binary and ternary linear codes with different hull dimensions

Maryam Bajalan - On the minimum distance and covering radius of irredundant orthogonal arrays

Peter Boyvalenkov - On a spherical code with 2025 points

Stefka Bouyuklieva - On the hulls of linear codes

Stela Zhelezova - Resolutions of cyclic 2-(40,4,1) designs

Peter Dragnev - Universal polarization of sharp codes in the Leech lattice