Constructions for Difference Triangle Sets
Yeow Meng Chee, Charles J. Colbourn

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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Mathematics and Applications · Graph Labeling and Dimension Problems
