Constructions for difference triangle sets

DOI10.1109/18.605606MaRDI QIDQ4345642zbMATH OpenOpenAlexFDO

Authors Yeow Meng Chee, Charles J. Colbourn

Publication date 1997

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0712.2553, https://hdl.handle.net/10356/91406

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Abstract: Difference triangle sets are useful in many practical problems of information transmission. This correspondence studies combinatorial and computational constructions for difference triangle sets having small scopes. Our algorithms have been used to produce difference triangle sets whose scopes are the best currently known.

Recommendations

• Bounds and construction for difference triangle sets
• A Recursive Construction For Regular Difference Triangle Sets
• scientific article; zbMATH DE number 1308941
• scientific article; zbMATH DE number 874513
• Further results on difference triangle sets
• A construction of difference sets
• Difference triangle sets from affine planes
• Low discrepancy constructions in the triangle
• Diffuse difference triangle sets
• Distinguishing between Sierpinski triangle constructions

Cited in

(6)

• Construction of LDPC convolutional codes via difference triangle sets
• Partially user-irrepressible sequence sets and conflict-avoiding codes
• A tabu search algorithm for difference triangle sets and Golomb rulers
• scientific article; zbMATH DE number 874513 (Why is no real title available?)
• A Recursive Construction For Regular Difference Triangle Sets
• New difference triangle sets by a field-programmable gate array-based search technique

This page was built for publication: Constructions for difference triangle sets

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