Abstract
Concepts from the theory of variable length codes are relativized to a language L so that demands are made only for those strings that belong to L. Decision procedures and regularity results appropriate for the relativized forms are given. This suggests the definition of a sequence of code types: the join codes of level k (1 ≤ k). At level 1 we have precisely the familiar comma free codes. For a join code of level k, a procedure for segmenting messages into code words is observed that consists of k steps, with each step being carried out in the elementary comma free manner. An illustration of this segmentation process is given using an idealization of the Watson-Crick base pairing of complementary strands of DNA. In this process the code words appear as ssDNA molecules in k distinct test tubes with each test tube content being washed over each incoming ssDNA complemented message strand. After k washings the sequence of attached code words provides the required segmentation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Berstel, D. Perrin, Theory of Codes, Academic Press, Orlando, FL, 1985.
C. T. Clelland, V. Risca, C. Bancroft, Hiding messages in DNA microdots, Nature, 399 (1999), 533–534.
E. R. Gumustop, Varieties of Codes and Codifiable Varieties of Monoids, Doctoral Dissertation in Mathematics, Binghamton University — State University of New York, Binghamton, NY, 1997.
F. Guzman, A complete list of small proper MSD and SD codes (manuscript).
F. Guzman, Decipherability of codes, J. Pure and Applied Algebra (to appear).
T. Head, Unique decipherability relative to a language, Tamkang J. Math., 11 (1980) 59–66.
T. Head, Gh. Păun, D. Pixton, Language theory and molecular genetics: generative mechanisms suggested by DNA recombination, in Vol. II of Handbook of Formal Languages (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, Berlin, 1997.
T. Head, A. Weber, Deciding multiset decipherability, IEEE Trans. Information Theory, 41 (1995), 291–297.
H. Jurgensen, S. Konstantinidis, Codes, in Vol. I of Handbook of Formal Languages (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, Berlin, 1997.
G. Lallement, Semigroups and Combinatorial Theory, Wiley, New York, NY, 1979.
A. Lempel, On multiset decipherable codes, IEEE Trans. Information Theory, 32 (1986), 714–716.
Gh. Păun, G. Rozenberg, & A. Salomaa, DNA Computing. New Computing Paradigms, Springer Verlag, Berlin, 1998.
A. Restivo, A note on multiset decipherable codes, IEEE Trans. Information Theory, 35 (1989), 662–663.
A. Weber, T. Head, The finest homophonic partition and related code concepts, IEEE Trans. Information Theory, 42 (1996), 1569–1575.
S. Yu, Regular languages, in Vol. I of Handbook of Formal Languages (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, Berlin, 1997.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag London Limited
About this chapter
Cite this chapter
Head, T. (2000). Relativized Code Concepts and Multi-Tube DNA Dictionaries. In: Finite Versus Infinite. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0751-4_11
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0751-4_11
Publisher Name: Springer, London
Print ISBN: 978-1-85233-251-8
Online ISBN: 978-1-4471-0751-4
eBook Packages: Springer Book Archive