IEICE TRANSACTIONS on Fundamentals
Another Optimal Binary Representation of Mosaic Floorplans
Summary :
Recently a compact code of mosaic floorplans with ƒ inner face was proposed by He. The length of the code is 3ƒ-3 bits and asymptotically optimal. In this paper, we propose a new code of mosaic floorplans with ƒ inner faces including k boundary faces. The length of our code is at most $3f - rac{k}{2} - 1$ bits. Hence our code is shorter than or equal to the code by He, except for few small floorplans with k=ƒ≤3. Coding and decoding can be done in O(ƒ) time.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E98-A No.6 pp.1223-1224
- Publication Date
- 2015/06/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E98.A.1223
- Type of Manuscript
- Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Katsuhisa YAMANAKA
Iwate University
Shin-ichi NAKANO
Gunma University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Katsuhisa YAMANAKA, Shin-ichi NAKANO, "Another Optimal Binary Representation of Mosaic Floorplans" in IEICE TRANSACTIONS on Fundamentals,
vol. E98-A, no. 6, pp. 1223-1224, June 2015, doi: 10.1587/transfun.E98.A.1223.
Abstract: Recently a compact code of mosaic floorplans with ƒ inner face was proposed by He. The length of the code is 3ƒ-3 bits and asymptotically optimal. In this paper, we propose a new code of mosaic floorplans with ƒ inner faces including k boundary faces. The length of our code is at most $3f - rac{k}{2} - 1$ bits. Hence our code is shorter than or equal to the code by He, except for few small floorplans with k=ƒ≤3. Coding and decoding can be done in O(ƒ) time.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.1223/_p
Copy
@ARTICLE{e98-a_6_1223,
author={Katsuhisa YAMANAKA, Shin-ichi NAKANO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Another Optimal Binary Representation of Mosaic Floorplans},
year={2015},
volume={E98-A},
number={6},
pages={1223-1224},
abstract={Recently a compact code of mosaic floorplans with ƒ inner face was proposed by He. The length of the code is 3ƒ-3 bits and asymptotically optimal. In this paper, we propose a new code of mosaic floorplans with ƒ inner faces including k boundary faces. The length of our code is at most $3f - rac{k}{2} - 1$ bits. Hence our code is shorter than or equal to the code by He, except for few small floorplans with k=ƒ≤3. Coding and decoding can be done in O(ƒ) time.},
keywords={},
doi={10.1587/transfun.E98.A.1223},
ISSN={1745-1337},
month={June},}
Copy
TY - JOUR
TI - Another Optimal Binary Representation of Mosaic Floorplans
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1223
EP - 1224
AU - Katsuhisa YAMANAKA
AU - Shin-ichi NAKANO
PY - 2015
DO - 10.1587/transfun.E98.A.1223
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2015
AB - Recently a compact code of mosaic floorplans with ƒ inner face was proposed by He. The length of the code is 3ƒ-3 bits and asymptotically optimal. In this paper, we propose a new code of mosaic floorplans with ƒ inner faces including k boundary faces. The length of our code is at most $3f - rac{k}{2} - 1$ bits. Hence our code is shorter than or equal to the code by He, except for few small floorplans with k=ƒ≤3. Coding and decoding can be done in O(ƒ) time.
ER -
English
