The exponent of a nonzero linear code over a finite field of characteristic p is the exponent in the highest power of p dividing the weights of all the ...
Ahstruct-The exponent of a nonzero linear code over a finite field of characteristic p is the exponent in the highest power of p dividing the weights of all the ...
When the codes in these theorems are regarded as modules over the groups involved, the numerical data determining the exponent of the divisor of the weights ...
HAROLD N. WARD; MULTILINEAR FORMS AND DIVISORS OF CODEWORD WEIGHTS, The Quarterly Journal of Mathematics, Volume 34, Issue 1, 1 March 1983, Pages 115–128,
Bibliographic details on Divisors of codeword weights.
People also ask
What is the weight of a codeword?
What is the difference between divisor and proper divisor?
Apr 27, 2022 · Abstract:Divisible codes are defined by the property that codeword weights share a common divisor greater than one.
MULTILINEAR FORMS AND DIVISORS OF CODEWORD WEIGHTS · H. Ward · Published 1 March 1983 · Mathematics · Quarterly Journal of Mathematics.
A linear code is called divisible if the weights of its codewords have a common divisor larger than 1. When the divisor 2 is relatively prime to the.
A linear q-ary block code is Δ-divisible if the Hamming weight of each of its codewords is divisible by divisor Δ.
Recall that a linear code C is r-divisible for r ∈ N if r | wt(c) for all c ∈ C. In the following, we denote by ∆(C) the greatest common divisor of all weights ...