Multichannel Communication and Graph Vertex Labeling Problems

Depending on the type of data, error measure, and type of failure, the problem of designing these encoding schemes is equivalent to several classical problems in graph theory. For example, no-redundancy encodings that minimize maximum absolute error for complete loss of data correspond to the problem of bandwidth optimization of Hamming graphs (Cartesian products of cliques). The graph problem has been open since the 1960s. In this thesis, we demonstrate lower bounds and a nearly optimal solution to this problem. Using techniques developed for this solution, we give an algorithm for the wirelength optimization problem of grid graphs (products of paths) of arbitrary dimensions. This is the first constructive result for the product of more than two paths. In the communications setting, this problem is equivalent to designing no-redundancy encodings that minimize average error of a distance-1 type of medium failure. Similar techniques solved an unrelated graph edge isoperimetric problem. In addition, extending the algorithm to allow redundancy in the encoding improved the only previously known constructive result.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2015

Author dc:creator

• Berger-Wolf, Yonit

Contributors dc:contributor

• Edward M. Reingold

• Mathematics

Language dc:language

eng

Identifier

(MiAaPQ)AAI3044052

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/81597