Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/11605
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kovačević, Mladen | en_US |
dc.date.accessioned | 2020-03-03T14:45:04Z | - |
dc.date.available | 2020-03-03T14:45:04Z | - |
dc.date.issued | 2019-07 | - |
dc.identifier.issn | 2157-8095 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/11605 | - |
dc.description.abstract | This paper studies the error correction problem for 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). Bounds on the size of optimal (d,k)-constrained codes correcting any given number of bit-shifts are derived, with a focus on their asymptotic form 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. | en_US |
dc.relation.ispartof | IEEE International Symposium on Information Theory - Proceedings | en_US |
dc.title | Bounds on Codes for the Bit-Shift Channel with (d,k)-Constrained Inputs | en_US |
dc.type | Conference Paper | en_US |
dc.identifier.doi | 10.1109/ISIT.2019.8849247 | - |
dc.identifier.scopus | 2-s2.0-85073153362 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85073153362 | - |
dc.description.version | Published | en_US |
dc.relation.lastpage | 1591 | en_US |
dc.relation.firstpage | 1587 | en_US |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
Appears in Collections: | IBS Publikacije/Publications |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.