On (n,k)-sequences: Properties and applications to coding

Chang Hyun Eo, Kyu Tae Park, Hong Yeop Song

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The (n,k)-sequences have an interesting interpretation as a generalization of, so-called, exponential Welch Costas sequences, some interesting combinatorial properties, and an additional application to designing various two-dimensional synchronization patterns such as «Vatican arrays» and sets of sonar arrays with ideal auto and cross correlation functions.

Original languageEnglish
Title of host publicationProceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998
Number of pages1
DOIs
Publication statusPublished - 1998 Dec 1
Event1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States
Duration: 1998 Aug 161998 Aug 21

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other1998 IEEE International Symposium on Information Theory, ISIT 1998
CountryUnited States
CityCambridge, MA
Period98/8/1698/8/21

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'On (n,k)-sequences: Properties and applications to coding'. Together they form a unique fingerprint.

  • Cite this

    Eo, C. H., Park, K. T., & Song, H. Y. (1998). On (n,k)-sequences: Properties and applications to coding. In Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998 [708965] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.1998.708965