|
This article is cited in 1 scientific paper (total in 1 paper)
Mathematical Methods of Cryptography
Search of an information message in noisy code blocks at repeated data transmission
Y. V. Kosolapov, O. Y. Turchenko Institute of Mathematics, Mechanics and Computer Sciences, Southern Federal University, Rostov-on-Don
Abstract:
The security model using the method of code noising is considered. It is assumed that the information blocks of length $k$ contain a fixed message $m$ of length $l\leq k$ on a fixed position $q$, $1\leq q\leq k-l+1$, and an observer gets noisy codewords of length $n$ through a binary symmetric channel with error probability $({1-\Delta})/2$, $0<\Delta\leq1$. The aim of the observer is to find the unknown message $m$, when position $q$ is unknown, and the length $l$ is known. We propose a method for finding $m$ and obtain an estimate for a sufficient number of observed codewords needed to recover the message $m$ in this way.
Keywords:
code noising, repeated data transmission.
Citation:
Y. V. Kosolapov, O. Y. Turchenko, “Search of an information message in noisy code blocks at repeated data transmission”, Prikl. Diskr. Mat. Suppl., 2016, no. 9, 55–57
Linking options:
https://www.mathnet.ru/eng/pdma281 https://www.mathnet.ru/eng/pdma/y2016/i9/p55
|
Statistics & downloads: |
Abstract page: | 238 | Full-text PDF : | 49 | References: | 31 |
|