Uniqueness of some linear subcodes of the extended binary Golay code

MaRDI QIDQ1310738zbMATH OpenFDO

Authors Stefan Dodunekov, Sylvia Encheva

Publication date 9 January 1994

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

linear codesGolay code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• More on the uniqueness of the Golay codes
• scientific article; zbMATH DE number 398938
• The \([18,9,6]\) code is unique
• Yet another approach to the extended ternary Golay code
• The sextuply shortened binary Golay code is optimal

Cited in

(13)

• The \([18,9,6]\) code is unique
• On the binary projective codes with dimension 6
• The sextuply shortened binary Golay code is optimal
• The extremal codes of length 42 with automorphism of order 7
• Some optimal self-orthogonal and self-dual codes
• On the minimum weights of binary linear complementary dual codes
• Asymptotic bound on binary self-orthogonal codes
• Determination of weight enumerators of binary extremal self-dual \([42,21,8]\) codes
• More on the uniqueness of the Golay codes
• On linear projective codes which satisfy the chain condition.
• Extremal self-dual \([40,20,8]\) codes with covering radius 7
• Projective codes which satisfy the chain condition
• Uniqueness of codes using semidefinite programming

This page was built for publication: Uniqueness of some linear subcodes of the extended binary Golay code

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