Title :
Divisors of codeword weights
fDate :
5/1/1983 12:00:00 AM
Abstract :
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 codewords. If the code is a right ideal in a group algebra the exponent is related to invariant multilinear forms on the code. This expository paper presents recent results obtained from that relation, extending earlier work of Delsarte and McEliece.
Keywords :
Linear coding; Algebra; Error correction; Error correction codes; Filling; Galois fields; Intersymbol interference; Linear code; Mathematics; Retirement; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1983.1056674