Encoding and decoding algorithms for an optimal latticebased code
Abstract
Shannon's random coding theorem gives an existence proof that codes exist which can transmit at rates arbitrarily close to channel capacity. However, no construction for such a random code has been given. This paper describes an optimal code which is not random, but has lattice structure. The code is constructed by selecting 2 to the 14th power points from a hypersphere in an 8dimensional spherepacking lattice. Encoding and decoding strategies for this lattice code are described. The high degree of symmetry in the lattice code is partially exploited to produce encoding and decoding algorithms, which are unexpectedly simple. At a biterrorrate of 0.00001, this lattice code is 5 dB better than 12 phase PSK and 2 dB better than 4 level QAM, both of which require about the same bandwidth as the lattice code.
 Publication:

ICC 1981; International Conference on Communications, Volume 3
 Pub Date:
 1981
 Bibcode:
 1981icc.....3...65D
 Keywords:

 Algorithms;
 Channel Capacity;
 Data Transmission;
 Decoding;
 Lattices (Mathematics);
 Signal Encoding;
 Adaptive Control;
 Bandwidth;
 Error Analysis;
 Optimal Control;
 Phase Shift Keying;
 Redundancy Encoding;
 Transmission Efficiency;
 Communications and Radar