Exponential Sums and Goppa Codes: I
From MaRDI portal
Publication:3204427
DOI10.2307/2048345zbMath0716.94010OpenAlexW4246270439MaRDI QIDQ3204427
Carlos Julio Moreno, Oscar Moreno
Publication date: 1991
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2048345
exponential sumsBCH codesGoppa polynomialcovering radius of long binary Goppa codesminimum distance of the dual of a binary Goppa
Linear codes (general theory) (94B05) Bounds on codes (94B65) Exponential sums (11T23) Zeta functions and related questions in algebraic geometry (e.g., Birch-Swinnerton-Dyer conjecture) (14G10)
Related Items (41)
The order of inverses mod q ⋮ Kloosterman sums with twice-differentiable functions ⋮ On a new class of pseudorandom numbers for simulation methods ⋮ Normality of the Thue-Morse function for finite fields along polynomial values ⋮ Two applications of Weil-Serre's explicit formula ⋮ A note on local randomness in polynomial random number and random function generators ⋮ The distribution of patterns of inverses modulo a prime. ⋮ Unnamed Item ⋮ New classes of NMDS codes with dimension 3 ⋮ Weil Sums over Small Subgroups ⋮ Exponential sums of nonlinear congruential pseudorandom number generators with Rédei functions ⋮ More constructions of pseudorandom sequences of \(k\) symbols ⋮ Generalized explicit inversive generators of small \(p\)-weight degree ⋮ On some exponential sums with exponential and rational functions ⋮ Kakeya-type sets in finite vector spaces ⋮ On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences ⋮ Irreducibility and the distribution of some exponential sums ⋮ Diameter, covering index, covering radius and eigenvalues ⋮ Large families of pseudorandom binary lattices by using the multiplicative inverse modulo P ⋮ Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation ⋮ Finite binary sequences constructed by explicit inversive methods ⋮ Algebraic entropy, automorphisms and sparsity of algebraic dynamical systems and pseudorandom number generators ⋮ Artin-Schreier curves, exponential sums, and coding theory ⋮ Lower bound of covering radius of binary irreducible Goppa codes ⋮ An improved Bombieri-Weil bound and applications to coding theory ⋮ New bounds on the distance distribution of extended Goppa codes ⋮ Modular hyperbolas and Beatty sequences ⋮ Partitions into two Lehmer numbers ⋮ A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order ⋮ On large families of subsets of the set of the integers not exceeding \(N\) ⋮ A note on cube-full numbers in arithmetic progression ⋮ On a problem of D. H. Lehmer ⋮ On a problem of D.H. Lehmer and pseudorandom binary sequences ⋮ On the sum of digits of special sequences in finite fields ⋮ ON THE GOWERS NORM OF PSEUDORANDOM BINARY SEQUENCES ⋮ Normal cyclotomic schemes over a finite commutative ring ⋮ A probabilistic analysis on a lattice attack against DSA ⋮ Pair correlation of values of rational functions (mod \(p\)) ⋮ Distribution of inverses in polynomial rings ⋮ Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration ⋮ Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables
This page was built for publication: Exponential Sums and Goppa Codes: I
