A class of codes is described having check matrices which are the tensor product of the check matrices of known nonbinary codes and binary codes. The error-correction, error-detection, and error-location capabilities of these codes are specified in terms of the properties of the component codes. The construction procedure allows for a class of codes with a wide variety of redundancies and error-control capabilities. Examples are given of codes from this class which correct random bursts of errors and bursts of bursts of errors.
No takes yet. Share an insight, caveat, or question.
J.K. Wolf (1965) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:
More from IEEE Transactions on Information Theory