New difference triangle sets by a field-programmable gate array-based search technique
From MaRDI portal
Cites work
- A class of binary recurrent codes with limited error propagation
- A note on the equivalence between strict optical orthogonal codes and difference triangle sets
- A tabu search algorithm for difference triangle sets and Golomb rulers
- Bounds and construction for difference triangle sets
- Bounds on the size of optimal difference triangle sets
- Combining Perfect Systems of Difference Sets
- Construction of LDPC convolutional codes via difference triangle sets
- Constructions for difference triangle sets
- Difference triangle sets from affine planes
- Disjoint difference sets, difference triangle sets, and related codes
- Further results on difference triangle sets
- Higher-order staircase codes
- scientific article; zbMATH DE number 3677846 (Why is no real title available?)
- scientific article; zbMATH DE number 3698968 (Why is no real title available?)
- scientific article; zbMATH DE number 1308941 (Why is no real title available?)
- scientific article; zbMATH DE number 3422259 (Why is no real title available?)
- Improved LP lower bounds for difference triangle sets
- Linear Size Optimal $q$-ary Constant-Weight Codes and Constant-Composition Codes
- On certain distributions of integers in pairs with given differences
- Optical orthogonal codes: design, analysis and applications
- Perfect difference families, perfect difference matrices, and related combinatorial structures
- The combined use of a genetic algorithm and the hill-climbing algorithm to find difference triangle sets
- The CRC handbook of combinatorial designs
- Using Directed Hill-Climbing for the Construction of Difference Triangle Sets
- Verification of a Conjecture of Th. Skolem.
This page was built for publication: New difference triangle sets by a field-programmable gate array-based search technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6879645)