Abstract
Rudolf Ahlswede introduced the theory of creating order roughly at the same time as his theory of identification. He was always surprised that it did not achieve the same popularity as identification. We shall here present a multi-user model in which, contrasting to Ahlswede’s original model, the size of the memory may vary in time. The influence of the maximum size of the memory device on the expected occurrence of the first 0 in the sequence produced by the organizer is studied. In the case that there is one outgoing bit in each time unit two steps of a simple random walk on the lattice can be combined to one step in a random walk for the exhaustion of the memory.
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.
References
Ahlswede, R., Kaspi, A.: Optimal coding strategies for certain permuting channels. IEEE Trans. Inf. Theory 33, 310–314 (1987)
Ahlswede, R., Ye, J.P., Zhang, Z.: Creating order in sequence spaces with simple machines. Information and Computation 89(1), 47–94 (1990)
Ahlswede, R., Zhang, Z.: Contributions to a theory of ordering for sequence spaces. Problems of Control and Information Theory 18(4), 197–221 (1989)
Berlekamp, E.R.: A class of convolutional codes. Information and Control 6, 1–13 (1963)
Coxeter, H.S.M.: Regular Polytopes, Dover (1973)
Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Addison-Wesley (1988)
Hollmann, H.D.L., Vanroose, P.: Entropy reduction, ordering in sequence spaces, and semigroups of non–negative matrices, preprint 95-092, SFB 343, University of Bielefeld (1995)
Kac, M.: Random walk and the theory of Brownian motion. American Mathematical Monthly 54, 369–391 (1947)
Kobayashi, K.: Combinatorial structure and capacity of the permuting relay channel. IEEE Trans. Inf. Theory 33, 813–826 (1987)
Piret, P.: Two results on the permuting mailbox channel. IEEE Trans. Inf. Theory 35, 888–892 (1989)
Rivlin, T.J.: The Chebyshev polynomials. Wiley (1974)
Savio, D.Y., Suryanarayan, E.R.: Chebyshev polynomials and regular polygons. American Mathematical Monthly 100, 657–661 (1993)
Spitzer, F.: Principles of Random Walks. Springer (1976)
Tamm, U.: Lattice paths not touching a given boundary. J. Statistical Planning and Inference 105(2), 433–448 (2002)
Vanroose, P.: Ordering in sequence spaces: an overview. In: Althöfer, I., Cai, N., Dueck, G., Khachatrian, L., Pinsker, M., Sárközy, A., Wegener, I., Zhang, Z. (eds.) Numbers, Information and Complexity. Kluwer (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Tamm, U. (2013). Creating Order and Ballot Sequences. In: Aydinian, H., Cicalese, F., Deppe, C. (eds) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science, vol 7777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36899-8_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-36899-8_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36898-1
Online ISBN: 978-3-642-36899-8
eBook Packages: Computer ScienceComputer Science (R0)