On Algebraic and Combinatorial Coding Theory (ACCT)
Fifteenth International Workshop
on Algebraic and Combinatorial Coding Theory (ACCT)
June 18-24, 2016, Albena, Bulgaria
Preliminary programme (as of May 25, 2016)
Saturday, June 18, 2016
Arrival Day
Sunday, June 19, 2016
09.00 – 09.20 L. Bassalygo, V. Zinoviev, On resolvable and near-resolvable BIB designs and q-ary equidistant codes
09.20 – 09.40 I. Mogilnykh, F. Solov'eva, Separability of homogeneous perfect codes from transitive
09.40 – 10.00 S. Dyshko, Isometry Groups of Combinatorial Codes
10.00 – 10.20 Ts. Baicheva, S. Topalova, Classification of optimal conflict-avoiding codes of weights 6 and 7
10.20 – 10.50 Coffee break
10.50 – 11.10 D. Bartoli, A. Davydov, A. Kreshchuk, S. Marcugini, F. Pambianco. Upper bounds on the smallest size of complete cap in PG(3,q) and PG(4,q)
11.10 – 11.30 A. Rousseva, I. Landjev, Characterization of Highly Divisible Arcs
11.30 – 11.50 E. Cheon, T. Maruta, Ts. Okazaki, Construction of some triple blocking sets in PG(2,q)
11.50 – 12.10 M. Alekseev, New polynomials for strong algebraic manipulation detection codes
12.15 – 13.30 Lunch
14.00 – 14.20 H. Bartz, V. Sidorenko, On Syndrome Decoding of Punctured Reed-Solomon and Gabidulin Codes
14.20 – 14.40 A. Kreshchuk, V. Potapov, Better goodness-of-fit statistics for coded FSK decoding
14.40 – 15.00 H. Kostadinov, N. Manev, On the Probability of Error for Triangular Quadrature Amplitude Modulation
15.00 – 15.20 D. Osipov, Obtaining reliability values from nonparametric receiver: the ``optimal'' parameter choice
19.00 Welcome party
Monday, June 20, 2016
09.00 – 09.20 D. Bikov, I. Bouyukliev, S. Bouyuklieva, S-Boxes from Binary Quasi-Cyclic Codes
09.20 – 09.40 Yu. Borisov, R. Tsenkov, Narrow Sense Linear Cryptanalysis of a Family of Modified DES Ciphers with Even Weight S-boxes
09.40 – 10.00 A. Daif, C. Tavernier, An efficient certificateless key management architecture to solve IBE and PKI issues
10.00 – 10.20 N. Beluhov, E. Kolev, Search for a moving target in a graph
10.20 – 10.50 Coffee break
10.50 – 11.10 J. Rifa, V. Zinoviev, Completely regular codes with different parameters and the same intersection array
11.10 – 11.30 A. Kasparian, I. Marinov, MacWilliams identities for linear codes as Riemann-Roch conditions
11.30 – 11.50 R. Palazzo Jr., L. de Lima, Geometrically Uniform n-shot Subspace Codes
11.50 – 12.10 V. Potapova, On Ryabko&Ryabko asymptotically optimal perfect steganographic scheme in a noisy channel
12.15 – 13.30 Lunch
14.00 – 14.20 P. Boyvalenkov, T. Marinova, M. Stoyanova, Nonexistence of (9,96,4) and (10,112,5) binary orthogonal arrays
14.20 – 14.40 T. Marinova, M. Stoyanova, Nonexistence of (9,112,4) and (10,224,5) binary orthogonal arrays
14.40 – 15.00 R. Daskalov, E. Metodieva, Improved lower bounds on m_r(2,29)
15.00 – 15.20 R. Daskalov, E. Metodieva, Some new (n,r)-arcs in PG(2,31)
15.20 – 15.40 R. Daskalov, M. Manev, A new (37,3)-arc in PG(2,23)
Tuesday, June 21, 2016
09.00 – 09.20 P. Loidreau, An evolution of GPT cryptosystem
09.20 – 09.40 O. Trushina, Anonymous Coherent Network Coding Against Active Adversary
09.40 – 10.00 A. Urivskiy, A. Rybkin, M. Borodin, On some properties of PRNGs based on block ciphers in counter mode
10.00 – 10.20 D. Kovalevskaya, On the Mollard code as a partially robust code
10.20 – 10.50 Coffee break
10.50 – 11.10 S. Bouyuklieva, R. Ruseva, E. Karatash, On some automorphisms of order 3 of the extremal binary codes
11.10 – 11.30 P. Comak, J. L. Kim, F. Ozbudak, Some new quasi-cyclic self-dual codes
11.30 – 11.50 N. Yankov, Binary s-extremal self-dual codes of length 68 do exist
12.00 – 13.30 Lunch
Excursion
Wednesday, June 22, 2012
09.00 – 09.20 I. Landjev, A. Rousseva, Linear Codes Close to the Griesmer Bound and the Related Geometric Structures
09.20 – 09.40 D. Bartoli, A. Davydov, G. Faina, S. Marcugini, F. Pambianco. Conjectural upper bounds on the smallest size of a complete cap in PG(N,q), N>=3
09.40 – 10.00 S. Topalova, S. Zhelezova, Parallelisms of PG(3,4) with automorphisms of order 3
10.00 – 10.20 K. Petrova, R. Tarjan, A Dynamic Data Structure for Segment Intersection Queries
10.20 – 10.50 Coffee break
10.50 – 11.10 C. Deppe, V. Lebedev, Finding one of D defective elements in the additive group testing model
11.10 – 11.30 A. D'yachkov, I. Vorobyev, N. Polyanskii, V. Shchukin, Adaptive Learning a Hidden Hypergraph
11.30 – 11.50 A. D'yachkov, I. Vorobyev, N. Polyanskii, V. Shchukin, On a Hypergraph Approach to Multistage Group Testing Problems
11.50 – 12.10 A. D'yachkov, I. Vorobyev, N. Polyanskii, V. Shchukin, Threshold Decoding for Disjunctive Group Testing
12.15 – 13.30 Lunch
14.00 – 14.20 J. de la Cruz, W. Willems, On LCD codes
14.20 – 14.40 E. Gabidulin, N. Pilipchuk, New constructions of multicomponent codes
14.40 – 15.00 S. Puchinger, S. Muelich, D. Moedinger, J. Nielsen, M. Bossert, Decoding Interleaved Gabidulin Codes using Alekhnovich’s Algorithm
15.00 – 15.20 I. Zhilin, V. Zyablov, D. Zigangirov, A binary block concatenated code based on two convolutional codes
Thursday, June 23, 2016
09.00 – 09.20 P. Boyvalenkov, P. Dragnev, D. Hardin, E. Saff, M. Stoyanova, Universal Lower Bounds on Energy and LP-Extremal Polynomials for (4,24)-Codes
09.20 – 09.40 P. Boyvalenkov, K. Delchev, On maximal antipodal spherical codes with few distances
09.40 – 10.00 D. Zinoviev, Steiner triple systems S(2^m-1,3,2) of 2-rank 2^m-m+2: construction and properties
10.00 – 10.20 D. Krotov, Perfect Trades of Small Length
10.20 – 10.50 Coffee break
10.50 – 11.10 S. Bezzateev, N. Shekhunova, A Lower Bound of the Covering Radius of Irreducible Goppa Codes
11.10 – 11.30 S. Muelich, S. Puchinger, M. Bossert, Low-rank matrix recovery using Gabidulin codes in characteristic zero
11.30 – 11.50 A. Vasil'eva, On the reconstruction of Preparata-like codes
11.50 – 12.10 F. Ivanov, On the minimum distance of LDPC codes based on repetition codes and permutation matrices
12.10 – 12.30 S. Boumova, Colengths of *-identities of simple *-algebras
12.15 – 13.30 Lunch
19.00 Official Dinner
Friday, June 24, 2016
Departure day