2000 character limit reached
Ranks of propelinear perfect binary codes
Published 31 Oct 2012 in math.CO, cs.IT, and math.IT | (1210.8253v1)
Abstract: It is proven that for any numbers n=2m-1, m >= 4 and r, such that n - log(n+1)<= r <= n excluding n = r = 63, n = 127, r in {126,127} and n = r = 2047 there exists a propelinear perfect binary code of length n and rank r.
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.