Abstract
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.
Full Text
Paper version not known (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call