Weakly mutually uncorrelated codes

S. M. Hossein; Tabatabaei Yazdi; Han Mao Kiah; Olgica Milenkovic

doi:10.1109/ISIT.2016.7541779

Weakly mutually uncorrelated codes

S. M. Hossein, Tabatabaei Yazdi, Han Mao Kiah, Olgica Milenkovic

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We introduce the notion of weakly mutually uncorrelated (WMU) sequences, motivated by applications in DNA-based storage systems and synchronization protocols. WMU sequences are characterized by the property that no sufficiently long suffix of one sequence is the prefix of the same or another sequence. In addition, WMU sequences used in DNA-based storage systems are required to have balanced compositions of symbols and to be at large mutual Hamming distance from each other. We present a number of constructions for balanced, error-correcting WMU codes using Dyck paths, Knuth's balancing principle, prefix synchronized and cyclic codes.

Original language	English (US)
Title of host publication	Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2649-2653
Number of pages	5
ISBN (Electronic)	9781509018062
DOIs	https://doi.org/10.1109/ISIT.2016.7541779
State	Published - Aug 10 2016
Event	2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: Jul 10 2016 → Jul 15 2016

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2016-August
ISSN (Print)	2157-8095

Other

Other	2016 IEEE International Symposium on Information Theory, ISIT 2016
Country/Territory	Spain
City	Barcelona
Period	7/10/16 → 7/15/16

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Online availability

10.1109/ISIT.2016.7541779

Library availability

Discover UIUC Full Text

Cite this

Hossein, S. M., Yazdi, T., Kiah, H. M., & Milenkovic, O. (2016). Weakly mutually uncorrelated codes. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory (pp. 2649-2653). Article 7541779 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2016.7541779

Weakly mutually uncorrelated codes. / Hossein, S. M.; Yazdi, Tabatabaei; Kiah, Han Mao et al.
Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc., 2016. p. 2649-2653 7541779 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Hossein, SM, Yazdi, T, Kiah, HM & Milenkovic, O 2016, Weakly mutually uncorrelated codes. in Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory., 7541779, IEEE International Symposium on Information Theory - Proceedings, vol. 2016-August, Institute of Electrical and Electronics Engineers Inc., pp. 2649-2653, 2016 IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 7/10/16. https://doi.org/10.1109/ISIT.2016.7541779

@inproceedings{f07ab1d9d48a4e4180651e4cdfcac3db,

title = "Weakly mutually uncorrelated codes",

abstract = "We introduce the notion of weakly mutually uncorrelated (WMU) sequences, motivated by applications in DNA-based storage systems and synchronization protocols. WMU sequences are characterized by the property that no sufficiently long suffix of one sequence is the prefix of the same or another sequence. In addition, WMU sequences used in DNA-based storage systems are required to have balanced compositions of symbols and to be at large mutual Hamming distance from each other. We present a number of constructions for balanced, error-correcting WMU codes using Dyck paths, Knuth's balancing principle, prefix synchronized and cyclic codes.",

author = "Hossein, {S. M.} and Tabatabaei Yazdi and Kiah, {Han Mao} and Olgica Milenkovic",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 IEEE International Symposium on Information Theory, ISIT 2016 ; Conference date: 10-07-2016 Through 15-07-2016",

year = "2016",

month = aug,

day = "10",

doi = "10.1109/ISIT.2016.7541779",

language = "English (US)",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "2649--2653",

booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",

address = "United States",

}

TY - GEN

T1 - Weakly mutually uncorrelated codes

AU - Hossein, S. M.

AU - Yazdi, Tabatabaei

AU - Kiah, Han Mao

AU - Milenkovic, Olgica

PY - 2016/8/10

Y1 - 2016/8/10

N2 - We introduce the notion of weakly mutually uncorrelated (WMU) sequences, motivated by applications in DNA-based storage systems and synchronization protocols. WMU sequences are characterized by the property that no sufficiently long suffix of one sequence is the prefix of the same or another sequence. In addition, WMU sequences used in DNA-based storage systems are required to have balanced compositions of symbols and to be at large mutual Hamming distance from each other. We present a number of constructions for balanced, error-correcting WMU codes using Dyck paths, Knuth's balancing principle, prefix synchronized and cyclic codes.

AB - We introduce the notion of weakly mutually uncorrelated (WMU) sequences, motivated by applications in DNA-based storage systems and synchronization protocols. WMU sequences are characterized by the property that no sufficiently long suffix of one sequence is the prefix of the same or another sequence. In addition, WMU sequences used in DNA-based storage systems are required to have balanced compositions of symbols and to be at large mutual Hamming distance from each other. We present a number of constructions for balanced, error-correcting WMU codes using Dyck paths, Knuth's balancing principle, prefix synchronized and cyclic codes.

UR - http://www.scopus.com/inward/record.url?scp=84985961516&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84985961516&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2016.7541779

DO - 10.1109/ISIT.2016.7541779

M3 - Conference contribution

AN - SCOPUS:84985961516

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2649

EP - 2653

BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016

Y2 - 10 July 2016 through 15 July 2016

ER -

Weakly mutually uncorrelated codes

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this