A simple lower bound of estimating of the checking symbols quantity
Keywords:Block coding, the Plotkin bound, minimum code distance
AbstractBased 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.
Кларк Дж., Кейн Дж. Кодирование с исправлением ошибок в системах цифровой связи. Пер. с англ. М.: Радио и связь, 1987. – 392 с.
Шеннон К. Работы по теории информации и кибернетике. Пер. с англ. М.:ИИЛ, 1963. – 828 с.
Липкин И.А. Статистическая радиотехника. Теория информации и кодирования. М.: Вузовская книга, 2002. – 210 с.
Прокис Дж. Цифровая связь. Пер. с англ. М.: Радио и связь, 2000. – 800 с.
How to Cite
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).