Storing and restoring floorplan partition data via removing sequences
Date of Publication
2018
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
Subject Categories
Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
A floorplan is a rectangle partitioned into smaller rectangles using vertical and horizontal line segments such that no four rectangles meet at the same point. One problem in coding theory is on storing and restoring oorplan partition data using binary codewords. There are several ways to do this, one way is via removing sequences of a oorplan. The removing sequence of a oorplan is essentially removing the upper-most left face of a oorplan sequentially until one face remains. In this paper we use the removing sequence of a oorplan to store and restore the data via binary codewords.
Abstract Format
html
Language
English
Format
Electronic
Accession Number
CDTU017661
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Recommended Citation
Chung, W. O., & Geronimo, J. L. (2018). Storing and restoring floorplan partition data via removing sequences. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/18574
