Notes on the Arithmetic BN Modulo A Codes

Properties of arithmetic norms of integers are applied to the study of arithmetic BN modulo A codes. Some new properties of such codes are established. Bounds on the size of such codes are derived and an efflcient algorithm for finding the optimal single and double error-correcting BN modulo A codes...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. C-21; no. 8; pp. 891 - 894
Main Authors Chiang, A. C. L., Reed, I. S.
Format Journal Article
LanguageEnglish
Published IEEE 01.08.1972
Subjects
Arithmetic codes
arithmetic norms
BN modulo A codes
Computers
Data mining
error patterns
optimal codes
Probability density function
Registers
Turing machines
Upper bound
Online AccessGet full text

Cover

More Information
Summary:Properties of arithmetic norms of integers are applied to the study of arithmetic BN modulo A codes. Some new properties of such codes are established. Bounds on the size of such codes are derived and an efflcient algorithm for finding the optimal single and double error-correcting BN modulo A codes is developed.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.1972.5009046