Ranks of propelinear perfect binary codes

DOI10.17377/SEMI.2013.10.033MaRDI QIDQ891014zbMATH OpenFDO

Authors G. K. Guskov, Ivan Yu. Mogilnykh, Faina I. Solov'eva

Publication date 16 November 2015

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1210.8253

zbMATH Keywords

ranktransitive codespropelinear perfect binary codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

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.

Recommendations

• Structural properties of binary propelinear codes
• On the number of nonequivalent propelinear extended perfect codes
• On the ranks and kernels problem for perfect codes
• On perfect codes: Rank and kernel
• A concatenation construction for propelinear perfect codes from regular subgroups of \(\mathrm{GA}(r,2)\)

Cited in

(6)

• Rank error-correcting pairs
• Transitive nonpropelinear perfect codes
• Structural properties of binary propelinear codes
• Binary perfect and extended perfect codes of lengths 15 and 16 and of ranks 13 and 14
• A concatenation construction for propelinear perfect codes from regular subgroups of \(\mathrm{GA}(r,2)\)
• On the number of nonequivalent propelinear extended perfect codes

This page was built for publication: Ranks of propelinear perfect binary codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891014)