






























We consider universal source coding of unlabeled graphs which are commonly referred to as graphical structures. We adopt an Erdös-Rényi model to generate the random graphical structures. We propose a variant of the previously introduced Type Size code, where type classes are characterized based on the number of edges of the graphical structures. The proposed scheme sorts the graphical structures based on the size of their type classes and assigns binary sequences to them in this order. The $ε$-coding rate of the Type Size code (up to the third-order term) for compressing graphical structures is derived.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。