Ranks of propelinear perfect binary codes
classification
🧮 math.CO
cs.ITmath.IT
keywords
binaryperfectpropelinearcodecodesexcludingexistslength
read the original abstract
It is proven that for any numbers n=2^m-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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.