Maximum distanceq-nary codes
- 1 April 1964
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 10 (2), 116-118
- https://doi.org/10.1109/tit.1964.1053661
Abstract
Aq-nary error-correcting code withN = q^{k}code words of lengthn = k + rcan have no greater minimum distancedthanr+1. The class of codes for whichd = r+1is studied first in general, then with the restriction that the codes be linear. Examples and construction methods are given to show that these codes exist for a number of values ofq, k, andr.Keywords
This publication has 2 references indexed in Scilit:
- Polynomial Codes Over Certain Finite FieldsJournal of the Society for Industrial and Applied Mathematics, 1960
- Orthogonal Arrays of Index UnityThe Annals of Mathematical Statistics, 1952