Abstract
The methodology of spatial ordering has been widely applied to many computational paradigms. A spatial ordering is usually expressed as a location code. This paper tries to fill the gap on the algebraic structures of spatial ordering. Several theorems on existence of the linear location code are stated and proved. The quadrant-recursive orders are characterized with Kronecker algebra. The generalized linear code and binomial location code are introduced to represent most applicable spatial orders. The outstanding sparsity presented in their characteristic matrices may significantly improve the computability of concerned paradigms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
