Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/11845
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Stojaković Z. | en |
dc.contributor.author | Stojaković M. | en |
dc.date.accessioned | 2020-03-03T14:46:04Z | - |
dc.date.available | 2020-03-03T14:46:04Z | - |
dc.date.issued | 2008-10-01 | en |
dc.identifier.issn | 03817032 | en |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/11845 | - |
dc.description.abstract | We define extended orthogonal sets of d-cubes and show that they are equivalent to a class of orthogonal arrays, to geometric nets and a class of codes. As a corollary an upper bound for maximal number of d-cubes in an orthogonal set is obtained. | en |
dc.relation.ispartof | Ars Combinatoria | en |
dc.title | On sets of orthogonal d-cubes | en |
dc.type | Journal/Magazine Article | en |
dc.identifier.scopus | 2-s2.0-56649106223 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/56649106223 | en |
dc.relation.lastpage | 30 | en |
dc.relation.firstpage | 21 | en |
dc.relation.volume | 89 | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
Appears in Collections: | FTN Publikacije/Publications |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.