New Bounds on 2-Frameproof Codes of Length 4
© 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...
Saved in:
Main Author: | Penying Rochanakul |
---|---|
Format: | Journal |
Published: |
2020
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85079067889&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/68462 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
Improved bounds on the size of separating hash families of short length
by: Penying Rochanakul
Published: (2020) -
Asymptotic bounds on frameproof codes
by: Xing, C.
Published: (2014) -
Improved constructions of frameproof codes
by: Chee, Yeow Meng, et al.
Published: (2013) -
New bounds on the minimum distance of cyclic codes
by: Ling, San, et al.
Published: (2021) -
On a class of constacyclic codes of length 4 ps over pm + upm
by: Hai Q. Dinh, et al.
Published: (2019)