2000 character limit reached
A partition of the hypercube into maximally nonparallel Hamming codes (1210.0010v2)
Published 28 Sep 2012 in cs.IT, cs.DM, math.CO, and math.IT
Abstract: By using the Gold map, we construct a partition of the hypercube into cosets of Hamming codes such that for every two cosets the corresponding Hamming codes are maximally nonparallel, that is, their intersection cardinality is as small as possible to admit nonintersecting cosets.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.