Bounds on the size of optimal difference triangle sets
From MaRDI portal
Publication:3818986
DOI10.1109/18.2652zbMath0666.94011OpenAlexW2052117459MaRDI QIDQ3818986
Publication date: 1988
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.2652
Communication, information (94A99) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (7)
Geometric orthogonal codes and geometrical difference packings ⋮ Lower bounds on multiple distinct sum sets ⋮ Disjoint sets of distinct sum sets ⋮ Florentine rows or left-right shifted permutation matrices with cross- correlation values \(\leq 1\) ⋮ Lower bounds on multiple difference sets ⋮ On lower bounds for numbered complete graphs ⋮ A tabu search algorithm for difference triangle sets and Golomb rulers
This page was built for publication: Bounds on the size of optimal difference triangle sets