Generalized weights and the Ball-Blokhuis congruence

ÖZEN İ.

DESIGNS CODES AND CRYPTOGRAPHY, cilt.79, sa.2, ss.231-235, 2016 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 79 Sayı: 2
  • Basım Tarihi: 2016
  • Doi Numarası: 10.1007/s10623-015-0046-x
  • Dergi Adı: DESIGNS CODES AND CRYPTOGRAPHY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.231-235
  • Marmara Üniversitesi Adresli: Evet

Özet

In a 2013 article, Ball and Blokhuis proved a congruence for a linear [n, k] code with a codeword of weight n. Their proof is based on a character sum on the group of 1 x (k-1) nonzeromatrices. We showthat the same argumentworks for groups of r x (k-1) matrices for every r, 1 <= r <= k. So we extend their theorem by giving a family of k congruences.