Mollard code as a robust nonlinear code

DOI10.1134/S0032946018010039MaRDI QIDQ2190916zbMATH OpenOpenAlexWikidataFDO

Authors D. I. Kovalevskaya

Publication date 23 June 2020

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0032946018010039

Mathematics Subject Classification ID

Other types of codes (94B60)

Recommendations

• On the Mollard code as a partially robust code
• On the symmetry group of the Mollard code
• New Class of Nonlinear Systematic Error Detecting Codes
• scientific article; zbMATH DE number 1811349
• On linear and nonlinear single-error-correcting q-nary perfect codes

Cites work

• A Generalized Parity Function and Its Use in the Construction of Perfect Codes
• Construction of perfect binary codes by sequential shifts of -components
• scientific article; zbMATH DE number 3926802 (Why is no real title available?)
• scientific article; zbMATH DE number 3321827 (Why is no real title available?)
• On nonsystematic perfect binary codes.
• On the ranks and kernels problem for perfect codes

Cited in

(1)

• On the Mollard code as a partially robust code

This page was built for publication: Mollard code as a robust nonlinear code

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