New families of perfect linear error-block codes
Summary: Linear error-block codes are a natural generalisation of linear error correcting codes. In this paper, we revisit all the known results on perfect linear error-block codes. We give the parameters of all perfect codes of minimum \(\pi\)-distance 3 and 4. The existence of new families of perfect codes is proven and their constructions are given. Moreover, some of these families are simultaneously perfect and MDS. Experimental results show that there exists only one class of parameters of perfect linear error-block codes of minimum \(\pi\)-distance 5. It is not likely to find further classes. See also the authors' previous articles: ``Improving code-based steganography with linear error-block codes. Digital Information Processing and Communications, Part II, ICDIPC 2011, Communications in Computer and Information Science 189, 310--321 (2011), \url{doi:10.1007/978-3-642-22410-2_27}], [``An application of linear error-block codes in steganography. Int. J. Digit. Inf. Wireless Commun. 1, No. 2, 426--433 (2011)] and [``Cyclicity and decoding of linear error-block codes. J. Theor. Appl. Inf. Technol. 25, No. 1, 39--42 (2011)].
This page was built for publication: New families of perfect linear error-block codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477996)
