Abstract :
The author reports on the performance of a new class of constrained codes, called weakly constrained codes. These codes do not strictly guarantee the imposed channel constraints, but rather generate codewords that violate, with a given (small) probability, the prescribed constraint. Weakly constrained codes are specifically of interest when it is desirable that the code rate R=p/q is very high, requiring codewords of length q>100
