Options
Gene Tagging and the Data Hiding Rate
File(s)
File | Description | Size | Format | |
---|---|---|---|---|
gene-tagging-issc-revised.pdf | 139.27 KB |
Author(s)
Date Issued
28 June 2012
Date Available
04T15:39:15Z October 2012
Abstract
We analyze the maximum number of ways in which one can intrinsically tag
a very particular kind of digital asset: a gene, which is just a DNA sequence that encodes
a protein. We consider gene tagging under the most relevant biological constraints:
protein encoding preservation with and without codon count preservation. We show
that our finite and deterministic combinatorial results are asymptotically—as the length
of the gene increases— particular cases of the stochastic Gel’fand and Pinsker capacity
formula for communications with side information at the encoder, which lies at the
foundations of data hiding theory. This is because gene tagging is a particular case of
DNA watermarking.
Sponsorship
Science Foundation Ireland
Type of Material
Conference Publication
Publisher
The Institution of Engineering and Technology
Copyright (Published Version)
2012, The Institution of Engineering and Technology
Subject – LCSH
Genes
DNA
Data encryption (Computer science)
Digital watermarking
Combinatorial analysis
Language
English
Status of Item
Peer reviewed
Conference Details
23nd IET Irish Signals and Systems Conference, Maynooth, Ireland, 28-29th June, 2012
This item is made available under a Creative Commons License
Owning collection
Views
1598
Last Month
6
6
Acquisition Date
Jun 2, 2023
Jun 2, 2023
Downloads
330
Last Week
3
3
Last Month
20
20
Acquisition Date
Jun 2, 2023
Jun 2, 2023