Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/70731
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPenying Rochanakulen_US
dc.date.accessioned2020-10-14T08:40:09Z-
dc.date.available2020-10-14T08:40:09Z-
dc.date.issued2020-01-01en_US
dc.identifier.issn16860209en_US
dc.identifier.other2-s2.0-85084473395en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85084473395&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/70731-
dc.description.abstract© 2020 by the Mathematical Association of Thailand. In this paper, we present some new upper bounds on the size of separating hash families of type {w1,w2} of short length, where the length N is not exceeding 2w2. A new proof for tight bounds on the size of separating hash families of type {1, w} is also given.en_US
dc.subjectMathematicsen_US
dc.titleImproved bounds on the size of separating hash families of short lengthen_US
dc.typeJournalen_US
article.title.sourcetitleThai Journal of Mathematicsen_US
article.volume2020en_US
article.stream.affiliationsChiang Mai Universityen_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.