Constructions for Difference Triangle Sets

TL;DR

This paper presents new combinatorial and computational methods for constructing difference triangle sets with minimal scopes, achieving the best known results in scope size.

Contribution

It introduces novel algorithms for constructing difference triangle sets with small scopes, improving upon previous known bounds.

Findings

Produced difference triangle sets with the smallest known scopes

Algorithms outperform previous methods in scope minimization

Enhances practical applications in information transmission

Abstract

Difference triangle sets are useful in many practical problems of information transmission. This correspondence studies combinatorial and computational constructions for difference triangle sets having small scopes. Our algorithms have been used to produce difference triangle sets whose scopes are the best currently known.