Abstract
The objective of this letter is to construct two classes of cyclic codes over $F_{p}$ with few weights, where $p$ is an odd prime. The weight distributions of these codes are determined. Some of the cyclic codes are optimal, which refers to meeting a certain bound on linear codes. The number of nonzero weights of these codes is not more than five and these codes can be employed to obtain secret sharing schemes.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
