In this correspondence, the trellis representation of the Kerdock and Delsarte-Goethals codes is addressed. It is shown that the states of a trellis representation of DG(m, δ) under any bit-order are either strict-sense nonmerging or strict-sense nonexpanding, except, maybe, at indices within the code's distance set. For δ > 3 and for m > δ, the state complexity, smax[DG(m, δ)], is found. For all values of m and δ, a formula for the number of states and branches of the biproper trellis diagram of DG(m, δ) is given for some of the indices, and upper and lower bounds are given for the remaining indices. The formula and the bounds refer to the Delsarte-Goethals codes when arranged in the standard bit-order.
- Biproper trellis
- Delsarte-Goethals code
- Kerdock code
- Rectangular codes
- Trellis complexity. © 1998 ieee publisher item identifier s 0018-9448(98)03481-6