Pages that link to "Item:Q5531450"
From MaRDI portal
The following pages link to A class of binary recurrent codes with limited error propagation (Q5531450):
Displaying 13 items.
- Nature-inspired metaheuristic algorithms to find near-OGR sequences for WDM channel allocation and their performance comparison (Q527255) (← links)
- Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design (Q990937) (← links)
- On the complexity of constructing Golomb rulers (Q1028469) (← links)
- Lower bounds on multiple difference sets (Q1185085) (← links)
- Construction of LDPC convolutional codes via difference triangle sets (Q2232118) (← links)
- Local search-based hybrid algorithms for finding Golomb rulers (Q2385176) (← links)
- The complexity of minimum difference cover (Q2458927) (← links)
- Homometric sets in trees (Q2509753) (← links)
- A tabu search algorithm for difference triangle sets and Golomb rulers (Q2571189) (← links)
- Application of Bat-Inspired Computing Algorithm and Its Variants in Search of Near-Optimal Golomb Rulers for WDM Systems: A Comparative Study (Q5150785) (← links)
- Problems on Two-Dimensional Synchronization Patterns (Q5322998) (← links)
- GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA (Q5696942) (← links)
- Diffuse difference triangle sets (Q5934178) (← links)