Substitution of characters in q-ARY m-sequences

I. Vajda, Tibor Nemetz

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

1 Citation (Scopus)

Abstract

This paper discusses a simple way of increasing the linear complexity of maximal length q-ary sequences. This is attained by using character substitution tables. The achievable maximum of increase is determined and it is shown that a portion of about 1/e of all substitution tables share this maximum. The mean value and the variance of the linear complexity is derived for the sequence's output by randomly chosen substitutions. The special case of permutations as substitutions are investigated, as well. At the end of the paper we propose an extension of the notion of linear complexity.

Original languageEnglish
Title of host publicationApplied Algebra, Algebraic Algorithms and Error-Correcting Codes - 8th International Conference, AAECC-8, Proceedings
PublisherSpringer Verlag
Pages96-105
Number of pages10
ISBN (Print)9783540541950
DOIs
Publication statusPublished - Jan 1 1991
Event8th International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1990 - Tokyo, Japan
Duration: Aug 20 1990Aug 24 1990

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume508 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1990
CountryJapan
CityTokyo
Period8/20/908/24/90

Fingerprint

M-sequence
Substitution
Linear Complexity
Substitution reactions
Tables
Mean Value
Permutation
Character
Output

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Vajda, I., & Nemetz, T. (1991). Substitution of characters in q-ARY m-sequences. In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 8th International Conference, AAECC-8, Proceedings (pp. 96-105). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 508 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-54195-0_42

Substitution of characters in q-ARY m-sequences. / Vajda, I.; Nemetz, Tibor.

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 8th International Conference, AAECC-8, Proceedings. Springer Verlag, 1991. p. 96-105 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 508 LNCS).

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

Vajda, I & Nemetz, T 1991, Substitution of characters in q-ARY m-sequences. in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 8th International Conference, AAECC-8, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 508 LNCS, Springer Verlag, pp. 96-105, 8th International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1990, Tokyo, Japan, 8/20/90. https://doi.org/10.1007/3-540-54195-0_42
Vajda I, Nemetz T. Substitution of characters in q-ARY m-sequences. In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 8th International Conference, AAECC-8, Proceedings. Springer Verlag. 1991. p. 96-105. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-54195-0_42
Vajda, I. ; Nemetz, Tibor. / Substitution of characters in q-ARY m-sequences. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 8th International Conference, AAECC-8, Proceedings. Springer Verlag, 1991. pp. 96-105 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{d3fdec83bd48436bb11ae271f699acba,
title = "Substitution of characters in q-ARY m-sequences",
abstract = "This paper discusses a simple way of increasing the linear complexity of maximal length q-ary sequences. This is attained by using character substitution tables. The achievable maximum of increase is determined and it is shown that a portion of about 1/e of all substitution tables share this maximum. The mean value and the variance of the linear complexity is derived for the sequence's output by randomly chosen substitutions. The special case of permutations as substitutions are investigated, as well. At the end of the paper we propose an extension of the notion of linear complexity.",
author = "I. Vajda and Tibor Nemetz",
year = "1991",
month = "1",
day = "1",
doi = "10.1007/3-540-54195-0_42",
language = "English",
isbn = "9783540541950",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "96--105",
booktitle = "Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 8th International Conference, AAECC-8, Proceedings",

}

TY - GEN

T1 - Substitution of characters in q-ARY m-sequences

AU - Vajda, I.

AU - Nemetz, Tibor

PY - 1991/1/1

Y1 - 1991/1/1

N2 - This paper discusses a simple way of increasing the linear complexity of maximal length q-ary sequences. This is attained by using character substitution tables. The achievable maximum of increase is determined and it is shown that a portion of about 1/e of all substitution tables share this maximum. The mean value and the variance of the linear complexity is derived for the sequence's output by randomly chosen substitutions. The special case of permutations as substitutions are investigated, as well. At the end of the paper we propose an extension of the notion of linear complexity.

AB - This paper discusses a simple way of increasing the linear complexity of maximal length q-ary sequences. This is attained by using character substitution tables. The achievable maximum of increase is determined and it is shown that a portion of about 1/e of all substitution tables share this maximum. The mean value and the variance of the linear complexity is derived for the sequence's output by randomly chosen substitutions. The special case of permutations as substitutions are investigated, as well. At the end of the paper we propose an extension of the notion of linear complexity.

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

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

U2 - 10.1007/3-540-54195-0_42

DO - 10.1007/3-540-54195-0_42

M3 - Conference contribution

AN - SCOPUS:84935495676

SN - 9783540541950

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 96

EP - 105

BT - Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 8th International Conference, AAECC-8, Proceedings

PB - Springer Verlag

ER -