[For fixed length codes see combinatorics.]

Marie-Pierre Beal: Codage symbolique.
Masson 1993, 216p. 2-22584173-X. FF 279.

Jean Berstel/D. Perrin: Theory of codes. 
Academic Press 1985. 0-12-093420-5. Pds. 82.

24741 Jean Berstel/D. Perrin/C. Reutenauer: Codes and automata.
Cambridge UP 2010, 620p. Preliminary version 2009.

Yannick Guesnet: On codes with a finite interpreting delay - a defect theorem.
Theor. Inf. Appl. 34 (2000), 47-59.

Yannick Guesnet: Maximal circular codes versus maximal codes.
Theor. Inf. Appl. 34 (ca. 2000), 351-365.

Yannick Guesnet: On maximal dense bifix codes.
J. Automata, Lang. Comb. 6 (2001), 263-273.

Yannick Guesnet: On maximal codes with a finite interpreting delay.
Theor. Comp. Sci. 273 (2002), 167-183.

7215 Roman Ko''nig: Lectures on codes. 1994.

Jean Neraud: On the deficit of a finite set of words.
Semigroup Forum  41 (1990), 1-21.

Jean Neraud : On the rank of the subsets of a free monoid.
Theor. Comp. Sci. 99 (1992), 231-241.

Jean Neraud: Deciding whether a finite set of words has rank at most 2.
Theor. Comp. Sci. 112/2 (1993), 311-337.

Jean Neraud/Carla Selmi: On codes with a finite deciphering delay -
constructing uncompletable words. Theor. Comp. Sci. 255 (2001), 151-162.

Jean Neraud/Carla Selmi: Locally complete sets and finite decomposable codes.
Theor. Comp. Sci. 273 (2002) 185-196

Carla Selmi: Over testable languages. Theor. Comp. Sci. 161 (1996), 157-190.