Bounds and construction for difference triangle sets
From MaRDI portal
Recommendations
Cited in
(20)- Lower bounds on multiple difference sets
- On lower bounds for numbered complete graphs
- Improved LP lower bounds for difference triangle sets
- Nonsymmetric configurations with natural index
- Lower bounds on multiple distinct sum sets
- Construction of LDPC convolutional codes via difference triangle sets
- Local search-based hybrid algorithms for finding Golomb rulers
- A tabu search algorithm for difference triangle sets and Golomb rulers
- Equivalence of some LP-based lower bounds for the Golomb ruler problem
- Disjoint difference sets, difference triangle sets, and related codes
- scientific article; zbMATH DE number 166923 (Why is no real title available?)
- scientific article; zbMATH DE number 1308941 (Why is no real title available?)
- Constructions for difference triangle sets
- scientific article; zbMATH DE number 2151241 (Why is no real title available?)
- Difference triangle sets from affine planes
- scientific article; zbMATH DE number 874513 (Why is no real title available?)
- A Recursive Construction For Regular Difference Triangle Sets
- Diffuse difference triangle sets
- New difference triangle sets by a field-programmable gate array-based search technique
- Two applications of relative difference sets: difference triangles and negaperiodic autocorrelation functions
This page was built for publication: Bounds and construction for difference triangle sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5750867)