Centrala begrepp
Introducing and studying the binary stretch embedding problem for edge-weighted graphs.
Sammanfattning
The article introduces the binary stretch embedding problem for edge-weighted graphs, closely related to addressing problems. It discusses isometric hypercube embedding and its applications. The use of Hadamard codes and linear programming techniques to find upper and lower bounds for certain classes of graphs is explored. Results are applied to Lee metric codes, deriving improved bounds. The paper also outlines an integer programming formulation and its linear relaxation for the problem.
Statistik
Isometric hypercube embedding introduced by Firsov in 1965.
Minimum length of binary code containing n codewords and minimum distance d.
Maximum size of Lee metric codes derived from results in the paper.
Hadamard codes used to find upper bounds in linear programming formulations.