The divisible code bound revisited

DOI10.1006/JCTA.2000.3124MaRDI QIDQ5937123zbMATH OpenOpenAlexFDO

Authors Harold N. Ward

Publication date 29 October 2001

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/280025417406bcce57b418ed00d43a626623395c

zbMATH Keywords

divisible code linear code MacWilliams identities self-dual code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Review text

A linear code over \(\text{GF}(q)\) is called divisible if the weights of its codewords have a common divisor \(\Delta > 1\). If \(\Delta\) is relatively prime to \(q\), the code is essentially a \(\Delta\)-fold replicated code. So the case of interest is when the characteristic \(p\) divides \(\Delta\). The author gives a new, character-free proof for his bound on the dimension of such a divisible code (originally proved in [\textit{H. N. Ward}, IEEE Trans. Inf. Theory 38, 191-194 (1992; Zbl 0746.94021)], by a character-theoretic argument) and discusses several applications, for instance to type I self-dual codes.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: The divisible code bound revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5937123)