Title :
On applying molecular computation to binary linear codes
Author :
Zimmermann, Karl-Heinz
Author_Institution :
Dept. of Comput. Eng., Technische Univ. Hamburg-Harburg, Hamburg, Germany
fDate :
2/1/2002 12:00:00 AM
Abstract :
Adleman´s (1994) successful solution of a seven-vertex instance of the NP-complete Hamiltonian directed path problem by a DNA algorithm initiated the field of biomolecular computing. In this correspondence, we describe DNA algorithms based on the sticker model to perform encoding, minimum-distance computation, and maximum-likelihood (ML) decoding of binary linear codes. We also discuss feasibility and limitations of the sticker algorithms
Keywords :
binary codes; biocomputing; linear codes; maximum likelihood decoding; DNA algorithm; ML decoding; binary linear codes; biomolecular computing; encoding; maximum-likelihood decoding; minimum-distance computation; molecular computation; sticker model; Biological system modeling; Biology computing; Computational modeling; Computer vision; DNA computing; Encoding; Linear code; Maximum likelihood decoding; Spine; Splicing;
Journal_Title :
Information Theory, IEEE Transactions on
