Error correcting code based on finite automaton and representation of numbers in the two-base numeration system

I.O. Zavadskyi

Abstract


A new error correcting code is introduced. It combines several approaches to constructing of error correcting codes: utilizing the arithmetic properties of numbers, represented by input bit sequences, encoding by finite automaton and by simple block code. Either encoding and decoding algorithms are presented.

Prombles in programming 2014; 2-3: 205-211


References


Johannesson R., Zigangirov K. Fundamentals of convolutional coding. – IEEE Press, 1999. – 400 p.

Anisimov A.V. Prefix Encoding by Means of the 2,3–Representation of Numbers // IEEE Transactions on Information Theory. – 2013. – Vol. 59.

– N 4. – P. 2359–2374.

Анисимов А.В., Завадский И.А. Помехоустойчивое префиксное кодирование на основе нижнего (2,3)-представления чисел //

Кибернетика и системный анализ. – 2014. – № 2. – С. 3–14.


Refbacks

  • There are currently no refbacks.