Abstract
In the codes which have code words with a constant sum of the non-zero information elements, the number of places N of the information elements is constant. The weights of the information elements may vary from 0 to R (where R is the radix of the number system) and the sum of all the information elements is G.
Preview
Unable to display preview. Download preview PDF.
References
H. C. A. van Duuren: Typendruktelegrafie over Radioverbindingen (TOR), Het PTT Bedrijf, 1 (1947–8) 35–41
R. Staehler: An Application of Boolean Algebra to Switching Circuit Design, Bell Syst. tech. J., 31 (1952) 280–305
R. M. M. Oberman, Relay Counting Chains, Codes and Translations in Dial Pulse Register Circuits, Proc. AIEE, 70 (1951) 1–5
W. H. Kautz: Constant Weight Counters and Decoding Trees, IRE Trans, electron. Comput., EC9 (1960) 231–44
R. M. M. Oberman, Disciplines in Combinational and Sequential Circuit Design (McGraw-Hill, New York, 1970) 432–8
D. Savir and G. J. Laurer, The Characteristics and Decodability of the Universal Product Code Symbol, IBM Syst. J., 14 (1975) 16–34
A. Snijders, Generation in Lexicographic Order of Code Words of Binary M-out-of-N Codes, Report 051 560-44 (1972) 03 (Switching Laboratory, Dept. of El. Engng, Delft, Netherlands)
Author information
Authors and Affiliations
Copyright information
© 1981 R. M. M. Oberman
About this chapter
Cite this chapter
Oberman, R.M.M. (1981). Constant-ratio Counters. In: Counting and Counters. Palgrave, London. https://doi.org/10.1007/978-1-349-81363-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-349-81363-6_4
Publisher Name: Palgrave, London
Print ISBN: 978-1-349-81365-0
Online ISBN: 978-1-349-81363-6
eBook Packages: Palgrave Social & Cultural Studies CollectionSocial Sciences (R0)