[IEEE IEEE International Symposium on Information Theory - Lausanne, Switzerland (30 June-5 July 2002)] Proceedings IEEE International Symposium on Information Theory, - Linear complexity of sequences over arbitrary symbols and constructions of sequences over GF(p/sup k/) whose characteristic polynomial is over GF(p)

The file will be sent to your email address. It may take up to 1-5 minutes before you receive it.

The file will be sent to you via the Telegram messenger. It may take up to 1-5 minutes before you receive it.

Note: Make sure you have linked your account to Z-Library Telegram bot.

The file will be sent to your Kindle account. It may take up to 1–5 minutes before you receive it.

Please note: you need to verify every book you want to send to your Kindle. Check your mailbox for the verification email from Amazon Kindle.