Automata for Codes

We survey the actual and potential roles of automata in the modelling of information transmission systems and, in particular, in the encoder, channel and decoder components of such systems. Our focus is on applications of codes in such systems and on the relevance of automaton theoretic methods to these applications. We discuss, for example, the issues of error-detection, fault-tolerance and error-correction for variable-length codes. Beyond reviewing known work in a possibly new setting, we also present some recent results on fault-tolerant decoders for systems in which synchronization errors are likely. We conclude with a kind of research programme, a list of rather general open problems requiring solutions.

[1]  Stavros Konstantinidis,et al.  Variable-Length Codes for Error Correction , 1995, ICALP.

[2]  James A. Anderson.  Automata Theory with Modern Applications: Languages and codes , 2006 .

[3]  Stavros Konstantinidis.  Error-Correction, and Finite-Delay Decodability , 2002, J. Univers. Comput. Sci..

[4]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[5]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[6]  Pedro V. Silva,et al.  Computing Maximal Error-detecting Capabilities and Distances of Regular Languages , 2010, Fundam. Informaticae.

[7]  Masami Ito,et al.  Outfix and Infix Codes and Related Classes of Languages , 1991, J. Comput. Syst. Sci..

[8]  Stavros Konstantinidis.  Transducers and the Properties of Error-Detection, Error-Correction, and Finite-Delay Decodability 1 , 2002 .

[9]  Stavros Konstantinidis,et al.  Maximal Solid Codes , 2001, J. Autom. Lang. Comb..

[10]  Jacques Sakarovitch,et al.  Elements of Automata Theory , 2009 .

[11]  Silviu Guiaşu,et al.  Information theory with applications , 1977 .

[12]  Stavros Konstantinidis,et al.  On a simple method for detecting synchronization errors in coded messages , 2003, IEEE Trans. Inf. Theory.

[13]  Helmut Jürgensen,et al.  Syntactic Monoids of Codes , 1999, Acta Cybern..

[14]  Yo-Sub Han,et al.  Overlap-Free Languages and solid Codes , 2011, Int. J. Found. Comput. Sci..

[15]  John P. Robinson,et al.  Error recovery for variable length codes , 1985, IEEE Trans. Inf. Theory.

[16]  G. Thierrin,et al.  Hypercodes, right convex languages and their syntactic monoids , 1981 .

[17]  Erich Valkema,et al.  Syntaktische Monoide Und Hypercodes , 1976 .

[18]  Dominique Perrin,et al.  Codes and Automata , 2009, Encyclopedia of mathematics and its applications.

[19]  Mohamed F. Mansour,et al.  Convolutional Decoding in the Presence of Synchronization Errors , 2010, IEEE Journal on Selected Areas in Communications.

[20]  Stavros Konstantinidis.  Error-Detecting Properties of Languages , 2000, Words, Languages & Combinatorics.

[21]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[22]  R. Brualdi,et al.  Handbook Of Coding Theory , 2011 .

[23]  Stavros Konstantinidis,et al.  Error Corrections for Channels with Substitutions, Insertions, and Deletions , 1995, Information Theory and Applications.

[24]  Paul H. Siegel,et al.  Variable-length codes and finite automata , 2010 .

[25]  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.

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

[27]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[28]  J. Berstel,et al.  Theory of codes , 1985 .

[29]  Helmut Jürgensen,et al.  Solid Codes , 1991, J. Inf. Process. Cybern..

[30]  Dominique Perrin,et al.  Codes and Automata (Encyclopedia of Mathematics and its Applications) , 2009 .

[31]  Gabriel Thierrin,et al.  The syntactic monoid of a hypercode , 1973 .

[32]  Stavros Konstantinidis.  Relationships between different error-correcting capabilities of a code , 2001, IEEE Trans. Inf. Theory.

[33]  Stavros Konstantinidis,et al.  Error correction and decodability , 1996 .

[34]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[35]  H. Jégou,et al.  Trellis state aggregation for soft decoding of variable length codes , 2005, IEEE Workshop on Signal Processing Systems Design and Implementation, 2005..

[36]  Pedro V. Silva,et al.  Maximal Error-Detecting Capabilities of Formal Languages , 2008, J. Autom. Lang. Comb..

[37]  H. Shyr.  Free monoids and languages , 1979 .

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

[39]  Stavros Konstantinidis.  An Algebra of Discrete Channels That Involve Combinations of Three Basic Error Types , 2001, Inf. Comput..

[40]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[41]  Nicolae Santean,et al.  On the definition of stochastic λ-transducers , 2009, Int. J. Comput. Math..

[42]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[43]  Gabriel Thierrin,et al.  The syntactic monoid of an infix code , 1990 .

[44]  Stavros Konstantinidis.  Structural Analysis of Error-Correcting Codes for Discrete Channels That Involve Combinations of Three Basic Error Types , 1999, IEEE Trans. Inf. Theory.