Bounds on the size of optimal difference triangle sets

DOI10.1109/18.2652MaRDI QIDQ3818986zbMATH OpenOpenAlexFDO

Authors Torleiv Kløve

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

Mathematics Subject Classification ID

Communication, information (94A99) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(8)

• 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
• Disjoint sets of distinct sum sets
• Lower bounds on multiple distinct sum sets
• Geometric orthogonal codes and geometrical difference packings
• A tabu search algorithm for difference triangle sets and Golomb rulers
• New difference triangle sets by a field-programmable gate array-based search technique

This page was built for publication: Bounds on the size of optimal difference triangle sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3818986)