The Sidel'nikov method for estimating the number of signs on segments of linear recurrence sequences over Galois rings

DOI10.1134/S0001434612030054zbMath1287.94042MaRDI QIDQ2435949

Oleg V. Kamlovskiy

Publication date: 21 February 2014

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

irreducible polynomialGalois ringbasic monic irreducible polynomialLinear recurrence sequencemethod of exponential sums

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Recurrences (11B37) Trigonometric and exponential sums (general theory) (11L03)

Related Items

Неабсолютные оценки для неполных тригонометрических сумм от линейных рекуррент и их приложения ⋮ Коэффициенты кросс-корреляции разрядных последовательностей равномерных линейных рекуррент над примарным кольцом вычетов ⋮ Bounds on the frequencies of tuples on parts of the period of linear recurring sequences over Galois rings

Cites Work

• Incomplete exponential sums over galois rings with applications to some binary sequences derived from Z/sub 2//sup l/
• The Most Significant Bit of Maximum-Length Sequences Over<tex>$BBZ_2^l$</tex>: Autocorrelation and Imbalance
• Random properties of the highest level sequences of primitive sequences over Z//sub 2/sup e//
• Frequency characteristics of linear recurrence sequences over Galois rings
• Complete weight enumerators of generalized Kerdock code and related linear codes over Galois ring
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item