Citation
Abstract
With the intention of finding binary block codes which are easily decoded, we examine decoding functions consisting of one level of symmetric functions. We find that all codes so decodable with fixed error correction capability t have rate less than 1/(2t + 1) and that this rate is achieved by the repetition code which has two code words and length 2t + 1. Decoding functions consisting of two or more levels of symmetric functions include all binary functions and can therefore decode arbitrarily good binary codes.
Details
- Volume
- II
- Published
- April 15, 1971
- Pages
- 62–64
- File Size
- 279.8 KB