Universal Compression and Retrieval
Universal Compression and Retrieval
On the Number of -Perfect Binary Codes: A Lower Bound
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We construct a class of perfect codes for an additive channel. The class contains classical Hamming codes.