How many weights can a cyclic code have ?
Information Theory
2018-11-16 v2 math.IT
Abstract
Upper and lower bounds on the largest number of weights in a cyclic code of given length, dimension and alphabet are given. An application to irreducible cyclic codes is considered. Sharper upper bounds are given for the special cyclic codes (called here strongly cyclic), {whose nonzero codewords have period equal to the length of the code}. Asymptotics are derived on the function {that is defined as} the largest number of nonzero weights a cyclic code of dimension over can have, and an algorithm to compute it is sketched. The nonzero weights in some infinite families of Reed-Muller codes, either binary or -ary, as well as in the -ary Hamming code are determined, two difficult results of independent interest.
Cite
@article{arxiv.1807.08418,
title = {How many weights can a cyclic code have ?},
author = {Minjia Shi and Xiaoxiao Li and Alessandro Neri and Patrick Solé},
journal= {arXiv preprint arXiv:1807.08418},
year = {2018}
}
Comments
submitted on 21 June, 2018