On new perfect binary nonlinear codes

DOI10.1007/S002000050080MaRDI QIDQ1360995zbMATH OpenOpenAlexFDO

Authors Antoine Lobstein, Victor A. Zinoviev

Publication date 23 July 1997

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002000050080

zbMATH Keywords

binary nonlinear perfect codesgeneralized concatenated codes

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Review text

The paper provides a new construction of binary nonlinear perfect codes with minimum distance 3. The construction is based on concatenation. Moreover, a lower bound on the number of mutually nonequivalent codes that can be constructed this way is provided. In practice, this lower bound is quite rough.

Recommendations

• scientific article; zbMATH DE number 1498836
• On generalized concatenated constructions of perfect binary nonlinear codes
• scientific article; zbMATH DE number 503208

Cited in

(12)

• Efficient representation of binary nonlinear codes: constructions and minimum distance computation
• 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
• Two new nonlinear binary codes
• A new class of nonlinear \(q\)-ary codes
• scientific article; zbMATH DE number 1037961 (Why is no real title available?)
• scientific article; zbMATH DE number 1498836 (Why is no real title available?)
• scientific article; zbMATH DE number 1792627 (Why is no real title available?)
• An optimum nonlinear code
• On perfect binary codes
• On generalized concatenated constructions of perfect binary nonlinear codes

This page was built for publication: On new perfect binary nonlinear codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1360995)