Abstract
In [5] Tiu and Wallace have constructed a new class of linear codes called Norm Quadratic Residue code C p for p> a prime of the form 4n+1 and determined some of its properties. It was shown that C p≤ p. He further conjectured that C p = p. In the present correspondence we show that similar construction works for primes of the form 4n-1. We further show that dim C p = p for any odd prime p and determine few elementary properties of these codes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. L. Graham and N. J. A. Sloane, On the covering radius of codes, IEEE Trans. Inform. Theory, Vol. IT-31,No. 3 (1985) pp. 385-401.
H. Janwa, On the optimality and covering radius of some algebraic geometric codes, Workshop on Coding Theory, Institute for Mathematics and Its Applications (IMA), University of Minnesota (1988).
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, New York (1977).
O. Perran, Bemerkungen über die Verteilung der quadratischen Reste, Math. Zeit, Vol. 56 (1952) pp. 122-130.
P. D. Tiu and A. Wallace, Norm quadratic residue codes, IEEE Trans. Inform. Theory, Vol. 40,No. 3 (1994) pp. 946-949.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bhandari, M.C., Gupta, M.K. & Lal, A.K. Some Results on NQR Codes. Designs, Codes and Cryptography 16, 5–9 (1999). https://doi.org/10.1023/A:1008387423552
Issue Date:
DOI: https://doi.org/10.1023/A:1008387423552