Name
Abstract | ||
|---|---|---|
A naive coding of floorplans needs 2m bits for each floorplan. In this paper we give a new simple coding of floorplans, which needs only 5m/3 bits for each floorplan. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1093/ietfec/e89-a.5.1181 | IEICE Transactions |
Keywords | Field | DocType |
coding floorplans,naive coding,floorplans need,fewer bits,new simple coding,algorithms,graphs | Graph,Coding (social sciences),Theoretical computer science,Mathematics,Floorplan | Journal |
Volume | Issue | ISSN |
E89-A | 5 | 1745-1337 |
Citations | PageRank | References |
4 | 0.51 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Katsuhisa Yamanaka | 1 | 60 | 15.73 |
| Shin-ichi Nakano | 2 | 246 | 24.40 |