31. We could, however, have chosen it as the first coset leader and constructed a different standard array. 32. A group of codes can be used to generate coset partitions, such as trellis codes and lattice codes. 33. There is no canonical preimage for a given function, but the set of all such preimages forms a coset . 34. The original algorithm for coset enumeration was invented by John Arthur Todd and H . S . M . Coxeter. 35. Thus each coset bijection is, in some sense, a maximal collection of mutually parallel pairs a > b. 36. So, it seems as if \ pm I, \ pm V would be a set of coset representatives. 37. Conceptually, this identifies the double coset space with the space of relative configurations of an-coset and a-coset. 38. Conceptually, this identifies the double coset space with the space of relative configurations of an-coset and a-coset. 39. Conceptually, this identifies the double coset space with the space of relative configurations of an-coset and a-coset . 40. To decode a vector using a standard array, subtract the error vector-or coset leader-from the vector received.
