A switching construction of partitions of n-cube into perfect binary codes is introduced. A lower bound on the number of such partitions is calculated.
| Abstracts file: | Guskov.Soloveva.LowerBoundPartitions.Short.pdf |
| Full text file: | Guskov.Soloveva.LowerBoundPartitions.pdf |