Special Session on Computer Algebra and application to combinatorics, coding theory and cryptography

Organized by  
  • Kenza Guenda (Vancouver, Canada)
  • Aaron Gulliver (Victoria, Canada)
  • Ilias Kotsireas (Waterloo, Canada)
  • Edgar Martinez Moro (Valladolid, Spain)
  • Steven Wang (Ottawa, Canada)

in the frame of the conference

ACA 2019, Montréal, Canada, July 16-20, 2019.

The goal of this session is to bring together researchers from all areas related to computer algebra (both theoretical and algorithmic) applied combinatorics, Coding theory and Cryptography. Since this area of research is very active much of the work related to these topics is recent or is still ongoing. For that this session will provide a stimulating forum where experts will report their recent results, and also explore new constructive ideas and approach toaward various application to propose new lines of research to scientific community and discuss open questions.

  • Codes and applications
  • Combinatorial structures
  • Algebraic-geometric codes
  • Network coding
  • Quantum codes
  • Group codes
  • Algebraic Cryptanalysis
  • Post-quantum cryptography
  • Code, Lattice and Hash-based PKC
  • Multivariate PKC
  • Elimination theory
  • computational commutative algebra
  • multivariate polynomial ideal theory
  • solving systems of algebraic equations
  • Algorithms for computing Groebner Bases

LIST OF TALKS

  1. Malihe Aliasgari
    Distributed Coded Computation, ABSTRACT
    New Jersey Institute of Technology, United States

  2. Boo Barkee, Michela Ceria, Theo Moriarty, Andrea Visconti
    Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures, ABSTRACT


  3. Curtis Bright, Kevin Cheung, Brett Stevens, Dominique Roy, Ilias Kotsireas, Vijay Ganesh
    Searching for projective planes with computer algebra and SAT solvers, ABSTRACT


  4. Michela Ceria, Teo Mora, Massimiliano Sala
    HELP: the knight gambit for efficient decoding of BCH codes, ABSTRACT


  5. Sanjit Bhowmick Satya Bagchi, Ramakrishna Bandi
    Linear Complementary Dual Codes over Z_2 Z_4 ABSTRACT


  6. Simon Eisenbarth
    Relative projective group ring codes over chain rings, ABSTRACT
    RWTH Aachen, Germany

  7. Kenza Guenda, Aaron T. Gulliver
    Error-correcting codes, ABSTRACT
    UVIC, Canada

  8. Daniel J. Katz
    Rudin-Shapiro-like sequences with low correlation, ABSTRACT
    California State University, Northridge, United States

  9. Petr Lisonek, Reza Dastbasteh
    Constructions of quantum codes, ABSTRACT


  10. Ted Hurley, National University of Ireland, Galway 
     Abstract: It is shown how maximum distance separable codes  may be constructed to required specifications. 
 The codes are explicitly given over finite fields with  efficient encoding and decoding algorithms of 
 complexity $\max\{O(n\log n), t^2\}$, where $t$ is the error-correcting capability of the code. 
 The codes are relatively easy to describe and implement. Series of such codes over finite fields 
 with ratio of distance to length approaching $(1-R)$ for given $R, \, 0 < R < 1$ can be derived. 
 For given rate $R=\frac{r}{n}$,  with $p$ not dividing $n$,  series of codes over finite fields of
 characteristic $p$ may be constructed such that the ratio of the distance to the length approaches $(1-R)$.

  11. Rama Krishna Bandi
    On Linear Complementary dual codes over finite chain rings, ABSTRACT
    International Institute of Information Technology Naya Raipur, Chattisgarh, India

  12. Petr Lisonek, Reza Dastbasteh
    Constructions of quantum codes, ABSTRACT

  13. Merce Villanueva
    University of Barcelona, Spain, ABSTRACT


  14. Steve Szabo
    Eastern Kentucky University, Kentucky, United States 
    Title: Codes over Rings and Their Duals
Abstract: In this talk, in the study of linear codes over rings,
considerations for choosing both the alphabet (ring) for a code and
the bilinear form by which the dual of the code is defined are
discussed.


  15. Pierre-Louis Cayrel
    St Etienne University, France, ABSTRACT


  16. Abhay Kumar Singh
    Symbol Pair Codes over Finite Rings Indian Institute of Technology, Dhanbad, India