, Volume 72, Issue 2, pp 331-344
Date: 13 Nov 2012

Relative one-weight linear codes

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Relative one-weight linear codes were introduced by Liu and Chen over finite fields. These codes can be defined just as simply for egalitarian and homogeneous weights over Frobenius bimodule alphabets. A key lemma helps describe the structure of relative one-weight codes, and certain known types of two-weight linear codes can then be constructed easily. The key lemma also provides another approach to the MacWilliams extension theorem.

Communicated by R. Hill.
In memory of Professor F. E. P. Hirzebruch, 17 October 1927–27 May 2012.