Coding and Cryptography

DOI10.1007/11779360MaRDI QIDQ5899203zbMATH OpenOpenAlexFDO

Authors San Ling, Ferruh Özbudak

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11779360

Mathematics Subject Classification ID

Trigonometric and exponential sums (general theory) (11L03) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Convolutional codes (94B10)

Recommendations

• An Improvement on the Bounds of Weil Exponential Sums Over Galois Rings With Some Applications
• An upper bound for Weil exponential sums over Galois rings and applications
• Improved bounds on Gauss sums in arbitrary finite fields
• Bounds for exponential sums over Galois rings
• Weil numbers, Gauss sums and Galois annihilators
• Further evaluations of Weil sums
• New bounds of Weyl sums
• An upper bound for the extended Kloosterman sums over Galois rings
• On Weyl sums over primes and almost primes
• Several generalizations of Weil sums

Cited in

(4)

• Some constructions of systematic authentication codes using Galois rings
• Weights modulo p^e of linear codes over rings
• An Improvement on the Bounds of Weil Exponential Sums Over Galois Rings With Some Applications
• An upper bound for Weil exponential sums over Galois rings and applications

This page was built for publication: Coding and Cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899203)