Pisano period codes
classification
💻 cs.IT
math.IT
keywords
codescyclicirreduciblepolynomialwhencharacteristiccheckclassification
read the original abstract
The cyclic codes with parity check polynomial the reciprocal of the characteristic polynomial of the Fibonacci recurrence over a prime finite field are shown to have either one weight or two weights. When these codes are irreducible cyclic we obtain many counterexamples to the conjectural classification of two-weight irreducible cyclic codes of Schmidt and White (2002). When they are reducible and projective their duals are uniformly packed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.