Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/159
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kovačević, Marko | en_US |
dc.date.accessioned | 2019-09-23T10:04:33Z | - |
dc.date.available | 2019-09-23T10:04:33Z | - |
dc.date.issued | 2019-08-01 | - |
dc.identifier.issn | 00189448 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/159 | - |
dc.description.abstract | © 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. | en |
dc.relation.ispartof | IEEE Transactions on Information Theory | en |
dc.title | Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1109/TIT.2019.2907979 | - |
dc.identifier.scopus | 2-s2.0-85069779679 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85069779679 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 4814 | en |
dc.relation.firstpage | 4804 | en |
dc.relation.issue | 8 | en |
dc.relation.volume | 65 | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
Appears in Collections: | FTN Publikacije/Publications |
SCOPUSTM
Citations
9
checked on Nov 20, 2023
Page view(s)
22
Last Week
14
14
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.