Name	Full text paper	Conference presentation
V. Afanassiev, A. Davydov. Incremental calculation of decoding failure probability for iterative decoding of Reed-Solomon product code
E. Alekseenko. A method of finding explicit equation for optimal curve of genus 4
T. Baicheva, S. Topalova. New perfect difference families
D. Bartoli, A. Davydov, G. Faina, A. Kreshchuk, S. Marcugini, F. Pambianco. Conjectural upper bounds on the smallest size of a complete arc in PG(2, q) based on an analysis of step-by-step greedy algorithms
D. Bartoli, A. Davydov, G. Faina, A. Kreshchuk, S. Marcugini, F. Pambianco, I. Tkachenko. Upper bounds on the smallest sizes of a complete arc in PG(2, q) based on computer search
D. Bartoli, G. Faina, S. Marcugini, F. Pambianco, J. Bierbrauer. A family of semifields of order 729
D. Bartoli, M. Giulietti, S. Marcugini, F. Pambianco, J. Bierbrauer. A projection construction for semifields and APN functions in characteristic 2
D. Bartoli, S. Marcugini, F. Pambianco. A probabilistic construction of low density quasi-perfect linear codes
L. Bassalygo, V. Zinoviev. On complete permutation polynomials
V. Baytchev, P. Boyvalenkov, K. Delchev. Packing of spherical caps of different radii on
P. Beelen , S. R. Ghorpade, S. U. Hasan . Linear Codes associated to Determinantal Varieties
S. Bezateev, N. Shekhunova. New Class of Quasi-cyclic Goppa Codes
S. Boev, I. Landjev. Homogeneous Arcs in Projective Hjelmslev Spaces
J. Borges , J. Rifa, V. Zinoviev. On nested completely regular codes and distance regular graphs
Yu. Borissov, M. H. Lee. On Hadamard Modulo Prime p Matrices of Size at most 2p + 1
I. Bouyukliev, M. Dzhumalieva-Stoeva, V. Monev. On the Classificaton of the Binary Self-Dual Codes of Length 40
S. Bouyuklieva, N. Yankov. Some binary self-dual codes having an automorphism of order 15
P. Boyvalenkov, P. Dragnev, D. Hardin, E. Saff, M. Stoyanova. On the Riesz energy of spherical designs
E. D. Carvalho , A. A. Andrade , T. Shah . Lattices codes from the ring
A. D’yachkov , I. Vorobyev , N. Polyanskii, V. Shchukin. Almost Disjunctive List-Decoding Codes
R. Daskalov, E. Metodieva. Five new (n, r)-arcs in PG(2, 29)
C. Deppe, V. Lebedev. Multiaccess problem with two active users
I. Dumer. Nested polarized codes: general design
I. Dumer. Nested polarized codes: decoding and node selection
A. Frolov. On the Hamming-Like Upper Bound on the Minimum Distance of LDPC Codes
A. Frolov. Upper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes
E. Gorkunov, E. Sotnikova. On Linear Rigidity of Codes
V. Gritsenko, A. Maevskiy. On construction of optimal codes in term rank metric via p(x)-circulants
F. Ivanov, V. Zyablov. LDPC codes based on Steiner quadruple systems and permutation matrices
G. Kabatiansky, S. Tavernier. Double Sparse Compressed Sensing Problem
Yu. Kageyama, T. Maruta. On the construction of optimal codes over
H. Kaneta, S. Marcugini, F. Pambianco. The First and Second Most Symmetric Nonsingular Cubic Surfaces
H. Kaneta, D. Bartoli, S. Marcugini, F. Pambianco. Low density quasi-perfect linear codes, small complete caps and symmetric surfaces
E. Kolev. Covering of with spheres of maximal radius
H. Kostadinov, N. Manev. Application of Error Control codes in Steganography
A. Kreshchuk, V. Zyablov, E. Ryabinkin. A new iterative decoder for product codes
K. Kumegawa, T. Maruta. Nonexistence of some Griesmer codes of dimension 4 over
I. Landjev, A. Rousseva, L. Storme. On the Extendability of Quasidivisible Optimal Arcs
M. H. Lee, H. Hai, X.-D. Zhang. The Fast Block Circulant Jacket Transform
T. Maruta, T. Tanaka, H. Kanda. New extension theorems for codes over
P. Loidreau. On cellular code and their cryptographic applications
I. Mogilnykh, F. Solov’eva. Linear coordinates and symmetry groups of perfect Mollard codes
I. Mogilnykh, F. Solov’eva. Existence of transitive nonpropelinear perfect code
S. Muelich, S. Puchinger, M. Bossert, M. Hiller, G. Sigl. Error correction for physical Unclonable Functions Using Generalized Concatenated Codes
J. S. R. Nielsen. Fast K\:otter–Nielsen–Hoholdt Interpolation in the Guruswami– Sudan Algorithm
J. S. R. Nielsen. Power Decoding Reed–Solomon Codes up to the Johnson Radius
M. Nyirenda. A Combinatorial Framework for Frequency Hopping Multiple Access
T. Okazaki, T. Maruta. New 4-dimensional linear codes over F9
D. Osipov. Order statistics-based decoder with reliability information in a multiple access system under interference
P. Rybin. On the Erasure-Correcting Capabilities of Irregular LDPC Codes
M. Sergeev. Preserving anonymity of data transfer in open wireless networks using network coding
A. Shishkin , E. Gabidulin, N. Pilipchuk. On cardinality of network subspace codes
I. Sysoev. Euclidian algorithm for linearized polynomials
U. Tamm. Lattice Packings by Clusters of Cubes in Coding Theory
O. Trushina. Towards to Anonymity in Physical-Layer Network Coding
A. Urivskiy. Broadcast Encryption Scheme Based on Binary Cubes
A. Vasil'eva. Are q-ary Perfect Codes reconstructed by the Vertices of Largest Level?
I. Zhilin , P. Rybin, F. Ivanov, V. Zyablov. On the Decoding of Tail-Biting UM-LDPC Codes
D. Zinoviev, V. Zinoviev. On the Preparata-like codes

LOCATION

The Workshop was held in the nice resort city Svetlogorsk located about 30 km from Kaliningrad (former Konigsberg), where the Immanuel Kant Baltic Federal University (former Albertina University of Konigsberg) is placed. Not only Kant but many other great scientists worked there, in particular, Bessel, Jacobi, Linderman, Gurvits, Hilbert and Helmholtz. The talks were given in the conference hall of Russ hotel**** , which was at disposal for conference participants only.