A new class ofB 1codes which have an information rate of(b-1)/bforb=2,3,4, \cdotsis presented. These codes correct error bursts up tobbits long when followed by a guard space of3b^{2} - 2b - 1bits. It is assumed that a hard decision is made on the fii sub-block ofbbits after one constraint length of the code is received and then feedback is used to modify the syndrome bits. One simplified decodhg scheme is described which uses simple logic for error correction. A detailed example is presented showing an application of the results. Several newB 1codes which meet the Wyner-Ash bound for minimum guard space are given. These codes were found by computer search.

A simple method is presented which defines Walsh functions in terms of products of Rademacher functions, but which preserves the ordering of the Walsh functions necessary to retain the notion of increasing number of zero crossings, or sequency.