scientific article; zbMATH DE number 3788532

From MaRDI portal
Publication:3966050





The aim of this paper is to characterize the \(0,1\) minimal redundancy codes of length \(n\), detecting \(l\) asymmetric errors. There is proved that for such a code \(C\) all code words \(\xi = (\xi_1,\ldots,\xi_n)\in C\) satisfy \[ \sum_{i=1}^n \xi_i \equiv \alpha\pmod{l+1}. \]











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 Q3966050)