How many distinct codewords can we pack into our formula 39-bit codeword vector? This means that symbols can be decoded instantaneously after their entire codeword is received. The idempotent of this code is the polynomial formula 17, corresponding to the codeword (0,1,1). Each one of them corresponds to a codeword. In the following example the alphabet is coded with the Dutch codeword 'nachtbommenwerper'. The default mode stores one ASCII character per 8-bit codeword. Kraft's inequality characterizes the sets of codeword lengths that are possible in a prefix code. Let denote the random variable given by the length of codeword . Thus, the transmitted codeword is {1100111010010111101011101110101}. Thus, each symbol in the input codeword will be on distinct delay line. A systematic code is one in which the message appears verbatim somewhere within the codeword. Another code property is the number of neighbors that a single codeword may have. It consists fundamentally of synchronism bits followed by the address codeword. BCD messages are space padded with trailing 0xC's to fill the codeword. Consequently, the code can detect and correct up to 2 errors in a codeword.