Theoretical proof for the number of errors that one linear code detects/corrects when linear quasigroups of order 4 are used for coding

DOI10.1142/S1793557124500529MaRDI QIDQ6651086

Natasha Ilievska

Publication date: 9 December 2024

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

linear codeHamming distancequasigroup

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Detection theory in information and communication theory (94A13) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Communication theory (94A05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the error-detecting capability of the linear quasigroup code
• Hardness of approximating the minimum distance of a linear code

This page was built for publication: Theoretical proof for the number of errors that one linear code detects/corrects when linear quasigroups of order 4 are used for coding

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