On nonsystematic perfect binary codes.

MaRDI QIDQ1130122zbMATH OpenFDO

Authors Sergey Avgustinovich, Faina I. Solov'eva

Publication date 19 August 1998

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cited in

(15)

• scientific article; zbMATH DE number 1188976 (Why is no real title available?)
• On enumeration of the perfect binary codes of length 15
• Affine 3-nonsystematic codes
• Embedding in a perfect code
• On nonsystematic perfect binary codes of length 15
• Equitable 2-partitions of the Hamming graphs with the second eigenvalue
• Full rank perfect codes and \(\alpha \)-kernels
• Systematic and nonsystematic perfect codes of infinite length over finite fields
• Perfect binary codes of infinite length with complete system of triples
• On perfect binary codes
• Affine 3-nonsystematic perfect codes of length 15
• Mollard code as a robust nonlinear code
• On nonlinear 1-quasi-perfect codes and their structural properties
• scientific article; zbMATH DE number 6004977 (Why is no real title available?)
• scientific article; zbMATH DE number 1103480 (Why is no real title available?)

This page was built for publication: On nonsystematic perfect binary codes.

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