The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
From MaRDI portal
Publication:5281435
Cited in
(19)- On separability of the classes of homogeneous and transitive perfect binary codes
- Switching codes and designs
- scientific article; zbMATH DE number 7310103 (Why is no real title available?)
- On perfect 2-colorings of the q-ary n-cube
- Transitive nonpropelinear perfect codes
- Affine 3-nonsystematic codes
- Bussey systems and Steiner's tactical problem
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation
- On full-rank perfect codes over finite fields
- A note on the symmetry group of full rank perfect binary codes
- On nonsystematic perfect binary codes of length 15
- Binary perfect and extended perfect codes of lengths 15 and 16 and of ranks 13 and 14
- Structure of Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+2\) over \(\mathbb F_2\)
- On switching equivalence of \(n\)-ary quasigroups of order 4 and perfect binary codes
- The classification of orthogonal arrays \(\mathrm{OA}(2048,14,2,7)\) and some completely regular codes
- An enumeration of 1-perfect ternary codes
- Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes
- On non-full-rank perfect codes over finite fields
- A concatenation construction for propelinear perfect codes from regular subgroups of \(\mathrm{GA}(r,2)\)
This page was built for publication: The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281435)
