00:00:00 / 00:00:00

Appears in collection : ALCOCRYPT - ALgebraic and combinatorial methods for COding and CRYPTography

A linear code over Fq with the Hamming metric is called ∆-divisible if the weights of all codewords are divisible by ∆. They have been introduced by Harold Ward a few decades ago. Applications include subspace codes, partial spreads, vector space partitions, and distance optimal codes. The determination of the possible lengths of projective divisible codes is an interesting and comprehensive challenge.

Information about the video

Citation data


Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow


  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
  • Get notification updates
    for your favorite subjects
Give feedback