Codes and Combinatorial Configurations


  • Results
    • Linear codes
      • Optimal
      • CRC
      • Griesmer
      • Self-orthogonal
      • Self-Dual
      • Two-Weight
      • Covering
      • Quasi-perfect
      • Classification of linear codes
        • Self-orthogonal
        • Divisible
        • Optimal
        • Generator matrices
      • Self-Polar Codes
    • Nonlinear codes
      • Optical Orthogonal Codes
    • Combinatorial designs
    • Combinatorial configurations of projective spaces
      • Spreads and Parallelisms
    • Cryptographic primitives
      • BoolSPL
      • QCSbox
      • Sbox
    • Orthogonal arrays
  • Publications
  • Software
    • QextNewEdition
      • Generation
      • LC Equivalence
      • WDHV
    • Q-extension
    • BoolSPL
    • BSbox-tools
    • GenSelfDual
  • Funding
    • Bulgarian National Science Fund
    • NVIDIA
  • Conferences and Seminars
    • ACCT
    • Optimal Codes and Releated Topics
    • Others
  • Contacts
  • About







  The Bulgarian National Seminar on Coding Theory was founded in 1988 by Prof. Stefan Dodunekov who was his head by the end of his life (2012). The seminar continues to take place every year and has become the largest national forum on Coding Theory and Related Topics (Combinatorics, Cryptography, Discrete Mathematics, Computer Science).

  This web-page contains some of the computational results obtained by participants in the Coding Theory Seminar or by participants in the seminar and their co-authors from all over the world. The collection includes classification results, structures with definite properties, particular examples and bounds on various extremal or optimal combinatorial objects, such as different types of codes (Griesmer, self-dual, double-weight, optical orthogonal, CRC, etc.), incidence structures with specific properties, cryptographic primitives (optimal S-boxes), etc. Access to part of the developed software is also possible. It can be used to obtain new results. Other information related to the results can be found, too.