On nonsystematic perfect binary codes.
From MaRDI portal
Publication:1130122
zbMATH Open1038.94560MaRDI QIDQ1130122FDOQ1130122
Authors: Sergey Avgustinovich, Faina I. Solov'eva 
Publication date: 19 August 1998
Published in: Problems of Information Transmission (Search for Journal in Brave)
Cited In (15)
- Title not available (Why is that?)
- 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
- On nonlinear 1-quasi-perfect codes and their structural properties
- Mollard code as a robust nonlinear code
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
