How Many Weights Can a Cyclic Code Have?
From MaRDI portal
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.
Recommendations
- How Many Weights Can a Quasi-Cyclic Code Have?
- How many weights can a linear code have?
- All two-weight irreducible cyclic codes?
- Weights of cyclic codes
- Determining the Number of One-Weight Cyclic Codes When Length and Dimension Are Given
- Several Classes of Cyclic Codes With Either Optimal Three Weights or a Few Weights
- scientific article; zbMATH DE number 1594298
- Weight distribution of a class of cyclic codes of length \(2^n\)
- The weight distribution of several classes of cyclic codes
- Weight enumerator of some irreducible cyclic codes
Cited in
(18)- Maximum weight spectrum codes
- How many weights can a linear code have?
- Complete \(b\)-symbol weight distribution of some irreducible cyclic codes
- A class of binary cyclic codes with optimal parameters
- How Many Figure Sets Are Codes?
- A family of cyclic codes with two zeros
- Four infinite families of ternary cyclic codes with a square-root-like lower bound
- The weight spectrum of two families of Reed-Muller codes
- A tight upper bound on the number of non-zero weights of a constacyclic code
- New upper bounds on the number of non-zero weights of constacyclic codes
- The maximum number of homogeneous weights of linear codes over chain rings
- A tight upper bound on the number of nonzero weights of a quasi-cyclic code
- Some bounds on the cardinality of the b-symbol weight spectrum of codes
- Representing GRM codes over finite rings
- A generalization of the Tang-Ding binary cyclic codes
- MWS and FWS codes for coordinate-wise weight functions
- The weight spectrum of generalized Reed-Muller codes RM_q((m-2)(q-1)+3,m)
- A tight upper bound on the number of nonzero weights of a quasi-twisted code
This page was built for publication: How Many Weights Can a Cyclic Code Have?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5123797)