Abstract
A particular kind of difference triangle sets (DTSs) called diffuse DTS (DDTS) are considered. Their combinatorial structure is underlying the construction of all known types of self-orthogonal diffuse codes. A number of constructions of DDTS are described, and lower and upper bounds on the maximal element of an optimal DDTS are given. The asymptotic behaviour of the maximal element is studied. Finally, tables of DDTS and of their minimal possible maximal elements are presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
