scientific article; zbMATH DE number 1498836
From MaRDI portal
Publication:4501027
The article is devoted to the problem of constructing perfect binary codes. Several modified concatenation constructions of perfect binary codes are presented. All of them are based on the generalized concatenation construction introduced by \textit{V.~A.~Zinoviev} [Top. Inf. Theory, Keszthely 1975, Colloq. Math. Soc. János Bolyai 16, 587-592 (1977; Zbl 0396.94015)]. A natural concatenation description of the Vasil'ev construction is presented. For the entire collection see [Zbl 0918.00043].
Recommendations
Cited in
(12)- On new perfect binary nonlinear codes
- Optimal non-projective linear codes constructed from down-sets
- On the constructions of constant-composition codes from perfect nonlinear functions
- Binary perfect codes of length 15 by the generalized concatenated construction
- Two classes of linear codes based on perfect nonlinear functions
- On Optimal Nonlinear Systematic Codes
- A survey of methods for constructing nonlinear perfect binary codes
- scientific article; zbMATH DE number 1037961 (Why is no real title available?)
- scientific article; zbMATH DE number 2154154 (Why is no real title available?)
- Non-Binary Diameter Perfect Constant-Weight Codes
- On perfect binary codes
- On generalized concatenated constructions of perfect binary nonlinear codes
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 Q4501027)
