Paper Info
Title
The largest number of weights in cyclic codes.
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 cyclic codes (called here strongly cyclic), all codewords of which have period the length. Asymptotics are derived on the function $Gamma(k,q),$ the largest number of nonzero weights a cyclic code of dimension $k$ over $F_q$ can have, and an algorithm to compute it is sketched.
Year
Venue
Field
2018
arXiv: Information Theory
Discrete mathematics,Upper and lower bounds,Cyclic code,Asymptotic analysis,Mathematics,Alphabet
DocType
Volume
Citations 
Journal
abs/1807.08418
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Minjia Shi127.25
Patrick Solé263689.68