A simple lower bound of estimating of the checking symbols quantity

Authors

  • D. Y. Tsurko National Technical University of Ukraine, Kyiv Politechnic Institute, Kiev
  • M. O. Starkov National Technical University of Ukraine, Kyiv Politechnic Institute, Kiev

DOI:

https://doi.org/10.20535/RADAP.2011.46.100-104

Keywords:

Block coding, the Plotkin bound, minimum code distance

Abstract

Based on boundary of minimum code distance has been found the boundary value of checking symbols in block codes with a given  number of correcting errors. Has been ana- lyzed the derived simple bound in relation to some well-known BCH codes. The obtained bound is valid except when the quantity of checking symbols is a maximum. Has been shown that estimate of the number of checking symbols with a given number of corrected errors is accurate only for highly secure codes.

Author Biographies

D. Y. Tsurko, National Technical University of Ukraine, Kyiv Politechnic Institute, Kiev

undergraduate

M. O. Starkov, National Technical University of Ukraine, Kyiv Politechnic Institute, Kiev

Ph.D.

References

Кларк Дж., Кейн Дж. Кодирование с исправлением ошибок в системах цифровой связи. Пер. с англ. М.: Радио и связь, 1987. – 392 с.

Шеннон К. Работы по теории информации и кибернетике. Пер. с англ. М.:ИИЛ, 1963. – 828 с.

Липкин И.А. Статистическая радиотехника. Теория информации и кодирования. М.: Вузовская книга, 2002. – 210 с.

Прокис Дж. Цифровая связь. Пер. с англ. М.: Радио и связь, 2000. – 800 с.

How to Cite

Цурко, Д. and Старков, М. (2011) “A simple lower bound of estimating of the checking symbols quantity”, Visnyk NTUU KPI Seriia - Radiotekhnika Radioaparatobuduvannia, 0(46), pp. 100-104. doi: 10.20535/RADAP.2011.46.100-104.

Issue

Section

Telecommunication, navigation, radar systems, radiooptics and electroacoustics