Beschrijving

In this book we apply the B-ordering of vectors of length n over the ring Z4. This ordering is a generalization of the B-ordering deinedfor vectors over binary field Z2, and over the prime field Zp.Then we study greedy codes generated by this ordering over the ring Z4 using Lee distance. Also we modify the greedy algorithm to anotherone called almost\