Citation
Abstract
Using a very simple combinatorial construction, we prove the existence of a binary simplex code with m codewords for all m2 1. The problem of the shortest possible length is left open. = iN +i -L. ifmisodd
Details
- Volume
- 42-39
- Published
- June 15, 1977
- Pages
- 36–37
- File Size
- 114.9 KB