Multisequences with large linear and k-error linear complexity from Hermitian function fields

Authors:
Chaoping Xing;Yang Ding
Affiliations:
Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore, Republic of Singapore;Department of Mathematics, Southeast University, Nanjing, China
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 18
Cited 0

Finite fields

Finite fields
Multi-sequences with almost perfect linear complexity profile and function fields over finite fields

Journal of Complexity
Linear complexity, k-error linear complexity, and the discrete Fourier transform

Journal of Complexity
The expected value of the joint linear complexity of periodic multisequences

Journal of Complexity
The expectation and variance of the joint linear complexity of random periodic multisequences

Journal of Complexity
Error linear complexity measures for multisequences

Journal of Complexity
Periodic multisequences with large error linear complexity

Designs, Codes and Cryptography
Algebraic Function Fields and Codes

Algebraic Function Fields and Codes
Proof of a conjecture on the joint linear complexity profile of multisequences

INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Asymptotic behavior of normalized linear complexity of multi-sequences

SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
The probabilistic theory of the joint linear complexity of multisequences

SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Sequences with almost perfect linear complexity profiles and curves over finite fields

IEEE Transactions on Information Theory
A relationship between linear complexity and k-error linear complexity

IEEE Transactions on Information Theory
On the expected value of the linear complexity and the k-error linear complexity of periodic sequences

IEEE Transactions on Information Theory
Periodic sequences with large k-error linear complexity

IEEE Transactions on Information Theory
Low-correlation, large linear span sequences from function fields

IEEE Transactions on Information Theory
On a Class of Pseudorandom Sequences From Elliptic Curves Over Finite Fields

IEEE Transactions on Information Theory
Enumeration results on the joint linear complexity of multisequences

Finite Fields and Their Applications

Quantified Score

Hi-index	754.84

Visualization

Abstract

In the present paper, by making use of some special properties of the Hermitian function fields, we construct multisequences with both large linear complexity and k-error linear complexity. Moreover, these sequences can be explicitly constructed.