Discrete Applied Mathematics
Adaptive coset partition for distributed video coding
Signal Processing
On Trellis Structures for Reed-Muller Codes
Finite Fields and Their Applications
On the number of lattice points in a small sphere and a recursive lattice decoding algorithm
Designs, Codes and Cryptography
Matrix product codes over finite commutative Frobenius rings
Designs, Codes and Cryptography
| Hi-index | 0.00 |
For pt.I see ibid., vol.34, no.5, p.1123-51 (1988). The family of Barnes-Wall lattices (including D4 and E 8) of lengths N=2n and their principal sublattices, which are useful in constructing coset codes, are generated by iteration of a simple construction called the squaring construction. The closely related Reed-Muller codes are generated by the same construction. The principal properties of these codes and lattices are consequences of the general properties of iterated squaring constructions, which also exhibit the interrelationships between codes and lattices of different lengths. An extension called the cubing construction generates good codes and lattices of lengths N=3×2n, including the Golay code and Leech lattice, with the use of special bases for 8-space. Another related construction generates the Nordstrom-Robinson code and an analogous 16-dimensional nonlattice packing. These constructions are represented by trellis diagrams that display their structure and interrelationships and that lead to efficient maximum-likelihood decoding algorithms