Robust error correction in infofuses

An infofuse is a combustible fuse in which information is encoded through the patterning of metallic salts, with transmission in the optical range simply associated with burning. The constraints, advantages and unique error statistics of physical chemistry require us to rethink coding and decoding schemes for these systems. We take advantage of the non-binary nature of our signal with a single bit representing one of N=7 states to produce a code that, using a single or pair of intensity thresholds, allows the recovery of the intended signal with an arbitrarily high recovery probability, given reasonable assumptions about the distribution of errors in the system. An analysis of our experiments with infofuses shows that the code presented is consistent with these schemes, and encouraging for the field of chemical communication and infochemistry given the vast permutations and combinations of allowable non-binary signals.

[1]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

[2]  John Stillwell Elements of Number Theory , 2002 .

[3]  David J. C. MacKay,et al.  Reliable communication over channels with insertions, deletions, and substitutions , 2001, IEEE Trans. Inf. Theory.

[4]  N.J.A. Sloane,et al.  On Single-Deletion-Correcting Codes , 2002, math/0207197.

[5]  Audrey K. Ellerbee,et al.  Infochemistry: encoding information as optical pulses using droplets in a microfluidic device. , 2009, Journal of the American Chemical Society.

[6]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[7]  Michael Mitzenmacher,et al.  Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels , 2007, IEEE Transactions on Information Theory.

[8]  Stephen B. Wicker,et al.  Reed-Solomon Codes and Their Applications , 1999 .

[9]  F. J. Holler,et al.  Principles of Instrumental Analysis , 1973 .

[10]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[11]  George M Whitesides,et al.  Long-duration transmission of information with infofuses. , 2010, Angewandte Chemie.

[12]  George M Whitesides,et al.  Infochemistry and infofuses for the chemical storage and transmission of coded information , 2009, Proceedings of the National Academy of Sciences.

[13]  James L. Massey,et al.  Review of 'Error-Correcting Codes, 2nd edn.' (Peterson, W. W., and Weldon, E. J., Jr.; 1972) , 1973, IEEE Trans. Inf. Theory.

[14]  G. Tenengolts,et al.  Nonbinary codes, correcting single deletion or insertion , 1984, IEEE Trans. Inf. Theory.

[15]  W. W. Peterson,et al.  Error-Correcting Codes. , 1962 .

[16]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[17]  Karen J. Olsen,et al.  NIST Atomic Spectra Database (version 2.0) , 1999 .

[18]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[19]  Michael Mitzenmacher,et al.  Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the $q$-ary Random Deletion Channel for Large $q$ , 2006, IEEE Transactions on Information Theory.

[20]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[21]  Michael Mitzenmacher,et al.  A Survey of Results for Deletion Channels and Related Synchronization Channels , 2008, SWAT.

[22]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[23]  Torleiv Kløve,et al.  Codes correcting a single insertion/deletion of a zero or a single peak-shift , 1995, IEEE Trans. Inf. Theory.

[24]  Gérard D. Cohen,et al.  Covering Codes , 2005, North-Holland mathematical library.