Switching equivalence classes of perfect codes
From MaRDI portal
Publication:1299914
DOI10.1023/A:1017150214026zbMath0938.94015OpenAlexW1538771370MaRDI QIDQ1299914
Publication date: 22 November 1999
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1017150214026
Related Items (8)
On the minimum distance graph of an extended Preparata code ⋮ On non-full-rank perfect codes over finite fields ⋮ Switching codes and designs ⋮ On perfect binary codes ⋮ On existence of perfect bitrades in Hamming graphs ⋮ On switching equivalence of \(n\)-ary quasigroups of order 4 and perfect binary codes ⋮ Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes. ⋮ On enumeration of the perfect binary codes of length 15
This page was built for publication: Switching equivalence classes of perfect codes
