video

sound

Persian Version

View:

60,310

Download:

21,044

Cites:

Information Journal Paper

Title

BINARY SEQUENCE/ARRAY PAIRS VIA DIFFERENCE SET PAIRS: A RECURSIVE APPROACH

Pages

  19-36

Abstract

 Binary array pairs with optimal/ideal correlation values and their algebraic counterparts \difference set pairs" (DSPs) in abelian groups are studied. In addition to generalizing known 1-dimensional (sequences) examples, we provide four new recursive constructions, unifying previously obtained ones. Any further advancements in the construction of BINARY SEQUENCEs/arrays with opti-mal/ideal correlation values (equivalently cyclic/abelian difference sets) would give rise to richer classes of DSPs (and hence binary perfect array pairs). Discrete signals arising from DSPs nd applications incryptography, CDMA systems, radar and wireless communications.

Cites

  • No record.

    • References

  • No record.

    • Cite

    APA: Copy

    ARASU, K.T., GOYAL, ANIKA, & PURI, ABHISHEK. (2017). BINARY SEQUENCE/ARRAY PAIRS VIA DIFFERENCE SET PAIRS: A RECURSIVE APPROACH. TRANSACTIONS ON COMBINATORICS, 6(3), 19-36. SID. https://sid.ir/paper/712790/en

    Vancouver: Copy

    ARASU K.T., GOYAL ANIKA, PURI ABHISHEK. BINARY SEQUENCE/ARRAY PAIRS VIA DIFFERENCE SET PAIRS: A RECURSIVE APPROACH. TRANSACTIONS ON COMBINATORICS[Internet]. 2017;6(3):19-36. Available from: https://sid.ir/paper/712790/en

    IEEE: Copy

    K.T. ARASU, ANIKA GOYAL, and ABHISHEK PURI, “BINARY SEQUENCE/ARRAY PAIRS VIA DIFFERENCE SET PAIRS: A RECURSIVE APPROACH,” TRANSACTIONS ON COMBINATORICS, vol. 6, no. 3, pp. 19–36, 2017, [Online]. Available: https://sid.ir/paper/712790/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops