Involution Solid and Join codes

Article type: Research Article

Authors: Jonoska, Nataša | Kari, Lila | Mahalingam, Kalpana

Affiliations: Department of Mathematics, University of South Florida, Tampa, 33620 - Florida, USA. E-mail: jonoska@math.usf.edu | Department of Computer Science, University of Western Ontario, London, Ontario, Canada-N6A5B7, Canada. E-mails: lila@csd.uwo.ca, kalpana@csd.uwo.ca

Note: [] Address for correspondence: 355, Middlesex College, Department of Computer Science, University of Western Ontario, London, ON N6A5B7, Canada

Abstract: In this paper we study a generalization of the classical notions of solid codes and commafree codes: involution solid codes (�-solid) and involution join codes (�-join). These notions are motivated by DNA strand design where Watson-Crick complementarity can be formalized as an antimorphic involution. We investigate closure properties of these codes, as well as necessary conditions for �-solid codes to be maximal. We show how the concept of �-join can be utilized such that codes that are not themselves �-comma free can be split into a union of subcodes that are �-comma free.

Journal: Fundamenta Informaticae, vol. 86, no. 1-2, pp. 127-142, 2008