About the k-Error Linear Complexity over F_p of sequences of length 2p with optimal three-level autocorrelation

11/23/2018
∙
by   Vladimir Edemskiy, et al.
∙
0
∙

We investigate the k-error linear complexity over F_p of binary sequences of length 2p with optimal three-level autocorrelation. These balanced sequences are constructed by cyclotomic classes of order four using a method presented by Ding et al.

READ FULL TEXT

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

Payment

Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Payment