Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/68462Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Penying Rochanakul | en_US |
| dc.date.accessioned | 2020-04-02T15:27:45Z | - |
| dc.date.available | 2020-04-02T15:27:45Z | - |
| dc.date.issued | 2020-01-01 | en_US |
| dc.identifier.issn | 16870425 | en_US |
| dc.identifier.issn | 01611712 | en_US |
| dc.identifier.other | 2-s2.0-85079067889 | en_US |
| dc.identifier.other | 10.1155/2020/4879108 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85079067889&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/68462 | - |
| dc.description.abstract | © 2020 Penying Rochanakul. Frameproof codes were first introduced by Boneh and Shaw in 1998 in the context of digital fingerprinting to protect copyrighted materials. These digital fingerprints are generally denoted as codewords in Qn, where Q is an alphabet of size q and n is a positive integer. A 2-frameproof code is a code C such that any 2 codewords in C cannot form a new codeword under a particular rule. Thus, no pair of users can frame a user who is not a member of the coalition. This paper concentrates on the upper bound for the size of a q-ary 2-frameproof code of length 4. Our new upper bound shows that C≤2q2-2q+1 when q is odd and q>10. | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | New Bounds on 2-Frameproof Codes of Length 4 | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | International Journal of Mathematics and Mathematical Sciences | en_US |
| article.volume | 2020 | en_US |
| article.stream.affiliations | Chiang Mai University | en_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.