Referenced Items are not available for this document.
We derive upper and lower bounds on the number of all variants a rectangular M×N matrix can be partitioned into fragments. Next the problem of matrix partitioning is considered as a particular example of a more general problem of constructing two-dimensional Markov processes (fields) on discrete rectangular lattices. We discuss a matrix-theoretical approach to the problem to explore the structure of discrete fields defined by a given matrix of local interaction
Published in:
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Date of Conference: 17-22 Sep 1995
- Meeting Date :
- 17 Sep 1995-22 Sep 1995
- Print ISBN:
- 0-7803-2453-6
- INSPEC Accession Number:
- 5267400
- Conference Location :
- Whistler, BC
- Digital Object Identifier :
- 10.1109/ISIT.1995.531179
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
