Two-weight code 

Description

A linear \(q\)-ary code whose codewords all have one of two possible nonzero Hamming weights.

Notes

See [1,2] for overviews of two-weight codes and Refs. [3,4] for examples.There is a classification of two-weight codes of length 40 [5] as well as of \([n,m,d]_q\) codes with the two weights \(n,d\) [6].Sizes of maximal two-weight, three-weight, and four-weight binary codes have been determined [7].

Parent

Child

Cousins

  • Divisible code — Two-weight codes are \(m\)-divisible, where \(m\) is the greatest common factor of their two possible weights.
  • Projective geometry code — There are several correpondences between projective and two-weight codes [2,6,8].
  • Weight-two code — Codewords of two-weight codes have one of two possible Hamming weights, while those of weight-two codes have Hamming weight two.
  • Simplex code — MacDonald codes are the unique two-weight codes with weights \(q^{k-1}-q^{u-1}\) and \(q^{k-1}\) [9].

References

[1]
A. E. Brouwer, "Two-weight Codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021) DOI
[2]
R. Calderbank and W. M. Kantor, “The Geometry of Two-Weight Codes”, Bulletin of the London Mathematical Society 18, 97 (1986) DOI
[3]
A. Cossidente and O. H. King, “Some two-character sets”, Designs, Codes and Cryptography 56, 105 (2010) DOI
[4]
A. Cossidente and G. Marino, “Veronese embedding and two–character sets”, Designs, Codes and Cryptography 42, 103 (2006) DOI
[5]
I. Bouyukliev, M. Dzhumalieva-Stoeva, and V. Monev, “Classification of Binary Self-Dual Codes of Length 40”, IEEE Transactions on Information Theory 61, 4253 (2015) DOI
[6]
D. Jungnickel and V. D. Tonchev, “The classification of antipodal two-weight linear codes”, Finite Fields and Their Applications 50, 372 (2018) DOI
[7]
A. Barg et al., “On the size of maximal binary codes with 2, 3, and 4 distances”, (2022) arXiv:2210.07496
[8]
A. E. Brouwer and M. van Eupen, Designs, Codes and Cryptography 11, 261 (1997) DOI
[9]
A. Patel, “Maximal<tex>q</tex>-nary linear codes with large minimum distance (Corresp.)”, IEEE Transactions on Information Theory 21, 106 (1975) DOI
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)— see instructions

edit on this site

Zoo Code ID: two_weight

Cite as:
“Two-weight code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2023. https://errorcorrectionzoo.org/c/two_weight
BibTeX:
@incollection{eczoo_two_weight, title={Two-weight code}, booktitle={The Error Correction Zoo}, year={2023}, editor={Albert, Victor V. and Faist, Philippe}, url={https://errorcorrectionzoo.org/c/two_weight} }
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/two_weight

Cite as:

“Two-weight code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2023. https://errorcorrectionzoo.org/c/two_weight

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/classical/q-ary_digits/weight/two_weight.yml.