Schedule
Sunday, April 3
17.00 - 20.00 · Registration (CAAS, ground floor)
Monday, April 4
8.00 - 8.45 · Registration (CAAS, ground floor)
| 8.45 | Opening |
| 9.00 | Invited Talk Mladen Kovačević · Timing channels and shift-correcting codes · slides |
| 9.50 | Invited Talk Michael Kiermaier · On q-analogs of the Fano plane · slides |
| 10.40 | Coffee |
| 11.10 | Anna-Lena Horlemann · Maximum rank distance codes are generic sets · slides |
| 11.35 | Umberto Martínez-Peñas · On the roots and minimum rank distance of skew cyclic codes |
| 12.00 | Diego Napp · Concatenation of convolutional codes and rank-metric codes for multishot network coding · slides |
| 12.30 | Lunch |
| 14.00 | Ago-Erik Riet · Structure of large equidistant Grassmannian codes · slides |
| 14.25 | Leo Storme · Primitive t-intersection constant dimension codes |
| 14.50 | Sascha Kurz · Improved upper bounds for partial spreads · slides |
| 15.15 | Coffee |
| 15.45 | Reinhard Laue · Large sets of t-designs with large blocks · slides |
| 16.10 | Vedran Krčadinac · New quasi-symmetric designs by the Kramer-Mesner method · slides |
| 16.35 | Marco Buratti · Steiner triple systems and their automorphism groups |
Tuesday, April 5
| 9.00 | Invited Talk Emina Soljanin · On network-induced locality and decoding constraints · slides | |
| 9.50 | Invited Talk Joachim Rosenthal · Public-key cryptosystems based on rank-metric codes and subspace codes | |
| 10.40 | Coffee | |
| 11.10 | Jens Zumbrägel · Designs in affine geometry · slides | |
| 11.35 | Reline Jurrius · On defining q-matroids · slides | |
| 12.00 | Michael Braun · On the q-analog of the revolving door algorithm | |
| 12.30 | Lunch | |
| Section A | Section B | |
| 14.00 | Ángela Barbero · Coding schemes with short erasure recovery delay | Francesco Pavese · On mixed dimension subspace codes · slides |
| 14.25 | Čedomir Stefanović · Random access via sign-compute-resolve on graphs | Anamari Nakić · On a property of (n, 2k-2, k)-subspace codes |
| 14.50 | Joonas Pääkkönen · Ensuring data availability in device-to-device caching clusters with regenerating codes | Kamil Otal · Polynomial approach to construct cyclic subspace codes · slides |
| 15.15 | Coffee | |
| 15.45 | Selahattin Gökceli · A random network coding testbed · slides | Daniel Heinlein · Coset construction for subspace codes · slides |
| 16.10 | Peter Farkas · Distributed method for topological interference alignment and its connection with network coding | Alberto Ravagnani · Equidistant subspace codes |
| 16.35 | Marco Calderini · Bounding the optimal rate of the ICCSI problem | Kristijan Tabak · Normalized difference sets tiling in Zp · slides |
Wednesday, April 6
| 9.00 | Invited Talk Thomas Honold · Constant-dimension codes exceeding the LMRD code bound · slides | |
| 9.50 | Invited Talk Angeles Vazquez-Castro · Coding and network coding over flag varieties | |
| 10.40 | Coffee | |
| Section A | Section B | |
| 11.10 | Stefan E. Schmidt · Generalized metrics for network coding | Andrea Švob · The Cameron-Liebler problem for sets · slides |
| 11.35 | Tobias Gaebel-Hoekenschnieder · Network based measurement theory | Morgan Rodgers · Cameron-Liebler type sets and completely regular codes in Grassmann graphs |
| 12.00 | Umberto Martínez-Peñas · Rank error-correcting pairs | Montserrat Alsina · On centers of hyperbolic tessellations and their applications |
| 12.30 | Lunch package | |
| 13.30 | Individual tour of the city walls | |
| 15.15 | Guided city tour | |
| 17.45 | Conference dinner | |
Thursday, April 7
| 9.00 | Invited Talk Camilla Hollanti · Locally repairable codes with availability and hierarchy: matroid theory via examples | ||
| 9.50 | Invited Talk Jonathan Jedwab · How many mutually unbiased bases can exist in complex space of dimension d? · slides | ||
| 10.40 | Coffee | ||
| 11.10 | Natalia Silberstein · Binary locally repairable codes with high availability via anticodes · slides | ||
| 11.35 | Vitaly Skachek · New bound for batch codes with restricted query size · slides | ||
| 12.00 | Thomas Westerbäck · Applications of algebraic combinatorics to codes and distributed storage systems | ||
| 12.30 | Lunch | ||
| Section A | Section B | ||
| 14.00 | Marina Šimac · LDPC codes based on μ-geodetic graphs | Netanel Raviv · Coding for locality in reconstructing permutations | |
| 14.25 | Regina Judák, Dávid Mezőfi · Comparison of some linear codes with high noise binary channel | Doris Dumičić Danilović · Block designs and self-orthogonal codes constructed from orbit matrices | |
| 14.50 | Wolfang Willems · On linear codes with complementary duals · slides | Vedrana Mikulić Crnković · On self-orthogonal codes generated by orbit matrices of 1-designs · slides | |
| 15.15 | Coffee | ||
| 15.45 | Paulo Almeida · Optimal 2D convolutional codes · slides | ||
| 16.10 | Marisa Toste · On MDS convolutional codes over Zp^r | ||
| 16.35 | Philippe Moustrou · On the density of cyclotomic lattices constructed from codes · slides | ||
Friday, April 8
| 9.00 | Invited Talk Daniel E. Lucani · Composite extension fields for (network) coding: designs and opportunities · slides |
| 9.50 | Invited Talk Simon R. Blackburn · Cryptography and network coding · slides |
| 10.40 | Coffee |
| 11.10 | Raquel Pinto · Rank-metric convolutional codes |
| 11.35 | Invited Talk Tuvi Etzion · What is old, what is new, and what to do? · slides |
| 12.25 | Closing |
| 12.30 | Lunch |
| 14.00 | MC meeting |