Ranks of propelinear perfect binary codes
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.