Abstract:
A method is proposed for finding the cyclic representatives of a cyclic code which corrects arithmetic errors. A formula is obtained for the code distance of one class of cyclic codes which are more efficient than the familiar Mandelbaum codes.
Fulltext:
PDF file (329 kB)