scientific article; zbMATH DE number 1811357
From MaRDI portal
Publication:3148516
The Phelps-LeVan construction of a perfect binary code of length \(n\) with the trivial kernel \[ C=\left(H\setminus \Biggl(\bigcup_{q=1}^{\log_{2} (n+1)} T_{i_q} + x_q\Biggr)\right) \cup \Biggl(\bigcup _{q=1}^{\log_{2} (n+1)} T_{i_q} + x_q + e_q\Biggr) \] is under study [see \textit{K. T. Phelps} and \textit{M. LeVan}, Des. Codes Cryptography 6, 247-257 (1995; Zbl 0837.94028)]. For all admissible lengths \(n\geq 15\), an explicit form is found for vectors \(x_1,\dots, x_{\log_{2} (n+1)}\) and coordinates \(i_1,\dots, i_{\log_{2} (n+1)}\).
Recommendations
- On kernels of perfect codes
- On perfect binary codes
- On perfect codes: Rank and kernel
- Perfect binary codes: bounds and properties
- scientific article; zbMATH DE number 1811359
- On a property of perfect binary codes
- scientific article; zbMATH DE number 850320
- scientific article; zbMATH DE number 503208
- Nearly perfect binary codes
- Perfect Codes of Length n with Kernels of Dimension $n-\log(n+1)-3$
Cited in
(2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3148516)