Determining the Number of One-Weight Cyclic Codes When Length and Dimension Are Given

From MaRDI portal
Publication:5426097

DOI10.1007/978-3-540-73074-3_22zbMath1236.94089OpenAlexW1531114857MaRDI QIDQ5426097

Gerardo Vega

Publication date: 15 November 2007

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73074-3_22




Related Items (16)

Linear codes over \({\mathbb{F}}_3+u\mathbb{F}_3+u^2\mathbb{F}_3\): MacWilliams identities, optimal ternary codes from one-Lee weight codes and two-Lee weight codesA characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite fieldThe weight distribution for any irreducible cyclic code of length \(p^m\)Group algebras and coding theoryA Family of Six-Weight Reducible Cyclic Codes and their Weight DistributionConstruction of one-Gray weight codes and two-Gray weight codes over \(\mathbb{Z}_{4} + u \mathbb{Z}_{4}\)Optimal \(p\)-ary codes from one-weight and two-weight codes over \(\mathbb{F}_p + v\mathbb{F}_p^* \)On the Number of Two-Weight Cyclic Codes with Composite Parity-Check PolynomialsTwo-weight cyclic codes constructed as the direct sum of two one-weight cyclic codesA correction on the determination of the weight enumerator polynomial of some irreducible cyclic codesAn improved method for determining the weight distribution of a family of \(q\)-ary cyclic codesA critical review and some remarks about one- and two-weight irreducible cyclic codesOne-weight codes in some classes of group ringsWeight distributions of a class of cyclic codes with arbitrary number of nonzeros in quadratic caseOptimal binary codes from one-Lee weight codes and two-Lee weight projective codes over \(\mathbb Z_4\)Weight distribution of cyclic codes with arbitrary number of generalized Niho type zeroes




This page was built for publication: Determining the Number of One-Weight Cyclic Codes When Length and Dimension Are Given