Paper Info
Title
Another Optimal Binary Representation Of Mosaic Floorplans
Abstract
Recently a compact code of mosaic floorplans with f inner face was proposed by He. The length of the code is 3 f - 3 bits and asymptotically optimal. In this paper, we propose a new code of mosaic floorplans with f inner faces including k boundary faces. The length of our code is at most 3 f - k/2 - 1 bits. Hence our code is shorter than or equal to the code by He, except for few small floorplans with k = f <= 3. Coding and decoding can be done in O( f) time.
Year
DOI
Venue
2015
10.1587/transfun.E98.A.1223
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
Keywords
Field
DocType
algorithm, coding, decoding, floorplan, mosaic floorplan
Discrete mathematics,Coding (social sciences),Theoretical computer science,Decoding methods,Mathematics,Binary number,Floorplan
Journal
Volume
Issue
ISSN
E98A
6
0916-8508
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Katsuhisa Yamanaka16015.73
Shin-ichi Nakano224624.40