g-Golomb Rulers
A set of positive integers A is called a g-Golomb ruler if the difference between two distinct elements of A is repeated at most g times. This definition is a generalization of the Golomb ruler (g = 1). In this paper we construct g-Golomb ruler from Golomb ruler and we prove two theorems about extrem...
שמור ב:
| הוצא לאור ב: | Revista Integración |
|---|---|
| Principais autores: | , , |
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Universidad Industrial de Santander
2015
|
| נושאים: | |
| גישה מקוונת: | https://www.redalyc.org/articulo.oa?id=327042947006 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|