Citation
Abstract
In implementing multifrequency PPM, a naturally arising question is: Let P be a fixed number; among all integer valued processes (math removed here), which has the largest entropy? Earlier work by McEliece and Rodemich answered this question, but there is no obvious way to use this process to implement a code for multifrequency PPM. The present article describes an easy-to-implement process Xj, Xo, ., with Ef IX, ep x, i) <P, whose entropy is nearly as great as that of the McEliece-Rodemich process.
Details
- Volume
- 42-77
- Published
- May 15, 1984
- Pages
- 57–63
- File Size
- 339.4 KB