We construct a family of finite maximal codes over the alphabet {a, b}
which verify the factorization conjecture on codes proposed by Schutz
enberger. This family contains any finite maximal code with at most th
ree occurrences of the letter b by word.