Construction of perfect binary codes by sequential shifts of \(\tilde\alpha\)-components
From MaRDI portal
Publication:1271418
zbMath0977.94057MaRDI QIDQ1271418
Faina I. Solov'eva, Sergei V. Avgustinovich
Publication date: 20 November 1998
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items (8)
Mollard code as a robust nonlinear code ⋮ On the cardinality spectrum and the number of Latin bitrades of order 3 ⋮ Perfect binary codes of infinite length ⋮ Switching codes and designs ⋮ On perfect binary codes ⋮ On a lower bound on the number of perfect binary codes ⋮ Construction of perfect \(q\)-ary codes by switchings of simple components ⋮ Full rank perfect codes and \(\alpha \)-kernels
This page was built for publication: Construction of perfect binary codes by sequential shifts of \(\tilde\alpha\)-components
