Non-binary block inseparable errors control codes

0Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The results of development and research of non-binary block inseparable codes such as mBnq (m > n, q > 2), combining error detection and correction with increase of an information rate are given. The code words are represented by points (vectors) in n-dimensional discrete space with the Minkowski metric (modular metric), appropriate to unsymmetrical multilevel channels. The estimation of the lower and upper bounds of correcting mBnq codes are given. The algorithm of quasi-compact packing of the code words with a given code distance in n-dimensional q-ary space with the Minkowski metric is offered. The block synchronization method on unallowed combinations of q-ary digits appearing on borders of the code words is considered. This method does not reduce an information rate. The estimation of probability of an error in Gaussian channels at usage of 5-ary and 7-ary correcting codes is given. The connection between Hadamard codes and mBnq codes is fixed.

Cite

CITATION STYLE

APA

Lev, A. Y., Lev, Y. A., & Okhrymenko, V. N. (2001). Non-binary block inseparable errors control codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2260, pp. 395–401). Springer Verlag. https://doi.org/10.1007/3-540-45325-3_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free