Pisano period codes
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- September 2017
- DOI:
- arXiv:
- arXiv:1709.04582
- Bibcode:
- 2017arXiv170904582S
- Keywords:
-
- Computer Science - Information Theory
- E-Print:
- 10 pages, submitted on 9th, September