Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке:
https://open.uns.ac.rs/handle/123456789/159
Назив: | Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis | Аутори: | Kovačević, Marko | Датум издавања: | 1-авг-2019 | Часопис: | IEEE Transactions on Information Theory | Сажетак: | © 1963-2012 IEEE. This work is motivated by the problem of error correction in bit-shift channels with the so-called (d,k) input constraints (where successive 1's are required to be separated by at least {d} and at most k zeros, 0 ≤ d < k ≤ ∞}). Bounds on the size of optimal (d,k)-constrained codes correcting a fixed number of bit-shifts are derived, with a focus on their asymptotic behavior in the large block-length limit. The upper bound is obtained by a packing argument, while the lower bound follows from a construction based on a family of integer lattices. Several properties of (d, k)-constrained sequences that may be of independent interest are established as well; in particular, the exponential growth rate of the number of (d, k)-constrained constant-weight sequences is characterized. The results are relevant for magnetic and optical information storage systems, reader-to-tag RFID channels, and other communication models where bit-shift errors are dominant and where (d, k)-constrained sequences are used for modulation. | URI: | https://open.uns.ac.rs/handle/123456789/159 | ISSN: | 00189448 | DOI: | 10.1109/TIT.2019.2907979 |
Налази се у колекцијама: | FTN Publikacije/Publications |
Приказати целокупан запис ставки
SCOPUSTM
Навођења
9
проверено 20.11.2023.
Преглед/и станица
22
Протекла недеља
14
14
Протекли месец
0
0
проверено 10.05.2024.
Google ScholarTM
Проверите
Алт метрика
Ставке на DSpace-у су заштићене ауторским правима, са свим правима задржаним, осим ако није другачије назначено.