Abstract
In this paper, we study quadratic residue (QR) codes of prime length [Formula: see text] over the ring [Formula: see text] with [Formula: see text] and [Formula: see text], where [Formula: see text] and [Formula: see text] are distinct odd prime numbers. We analyze some basic properties of cyclic codes of length [Formula: see text] over [Formula: see text], we define QR codes by their generating idempotents. Further, we discuss the extended QR codes. We present a considerable number of good [Formula: see text]-ary codes as Gray images of QR codes over [Formula: see text] by considering the case when [Formula: see text] is an odd prime.
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
