New Bounds on 2-Frameproof Codes of Length 4
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2020/4879108 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832561449109553152 |
|---|---|
| author | Penying Rochanakul |
| author_facet | Penying Rochanakul |
| author_sort | Penying Rochanakul |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-ab29eed66c0341fb8f2e5c255ae6c746 |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-ab29eed66c0341fb8f2e5c255ae6c7462025-02-03T01:24:57ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04252020-01-01202010.1155/2020/48791084879108New Bounds on 2-Frameproof Codes of Length 4Penying Rochanakul0Research Center in Mathematics and Applied Mathematics, Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, ThailandFrameproof 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.http://dx.doi.org/10.1155/2020/4879108 |
| spellingShingle | Penying Rochanakul New Bounds on 2-Frameproof Codes of Length 4 International Journal of Mathematics and Mathematical Sciences |
| title | New Bounds on 2-Frameproof Codes of Length 4 |
| title_full | New Bounds on 2-Frameproof Codes of Length 4 |
| title_fullStr | New Bounds on 2-Frameproof Codes of Length 4 |
| title_full_unstemmed | New Bounds on 2-Frameproof Codes of Length 4 |
| title_short | New Bounds on 2-Frameproof Codes of Length 4 |
| title_sort | new bounds on 2 frameproof codes of length 4 |
| url | http://dx.doi.org/10.1155/2020/4879108 |
| work_keys_str_mv | AT penyingrochanakul newboundson2frameproofcodesoflength4 |