Abstract
In this section we shall obtain certain combinatorial properties of sequences of n integers, each integer one of 1, . . . , a. The motivation for our interest in these properties will become apparent in Chapter 3. By at once proving the necessary facts we gain in efficiency at the expense of a temporary lack of motivation. To avoid the trivial we assume, throughout this monograph, that a ≧ 2 and n ≧ 2; the main interest in application will usually be for large n.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wolfowitz, J. (1978). Combinatorial Preliminaries. In: Coding Theorems of Information Theory. Ergebnisse der Mathematik und ihrer Grenzgebiete, vol 31. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-66822-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-66822-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-66824-1
Online ISBN: 978-3-642-66822-7
eBook Packages: Springer Book Archive