On shifting sets in the binary hypercube
- 25 Downloads
If two codes with distance 3 have some coincident neighborhoods then each of them is called a shifting set. In the binary (4k + 3)-dimensional hypercube, there exists a shifting set of power 2 · 6 k which can be neither divided into shifting sets of less size nor represented as a natural dilatation of a shifting set of less size.
KeywordsFull Rank Parity Check Code Dimension Standard Vector Problem Inform
Unable to display preview. Download preview PDF.
- 5.V. N. Potapov, “A Lower Bound for the Number of Transitive Perfect Codes,” Discret. Anal. Issled. Oper. Ser. 1, 13(4), 49–59 (2006) [J. Appl. Industr. Math. 1 (3), 373–379 (2007)].Google Scholar
- 6.F. I. Solov’eva, “On Factorization of Code-Generating D.N.F.,” in Methods of Discrete Analysis, Vol. 47 (Sobolev Inst. Math., Novosibirsk, 1988), pp. 66–88.Google Scholar
- 10.A. Yu. Vasil’eva, “A Representation of Perfect Binary Codes,” in Proceedings of the Seventh International Workshop on Algebraic and Combinatorial Coding Theory (Bansko, Bulgaria, 2000), pp. 311–315.Google Scholar