Bounds and construction for difference triangle sets
From MaRDI portal
Publication:5750867
DOI10.1109/18.32165zbMath0719.05014OpenAlexW2165083003MaRDI QIDQ5750867
Publication date: 1989
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.32165
Related Items (11)
Local search-based hybrid algorithms for finding Golomb rulers ⋮ Lower bounds on multiple distinct sum sets ⋮ Two applications of relative difference sets: difference triangles and negaperiodic autocorrelation functions ⋮ Construction of LDPC convolutional codes via difference triangle sets ⋮ Lower bounds on multiple difference sets ⋮ Diffuse difference triangle sets ⋮ Unnamed Item ⋮ On lower bounds for numbered complete graphs ⋮ A tabu search algorithm for difference triangle sets and Golomb rulers ⋮ Equivalence of some LP-based lower bounds for the Golomb ruler problem ⋮ Nonsymmetric configurations with natural index
This page was built for publication: Bounds and construction for difference triangle sets