Minimum distance bounds for cyclic codes and Deligne's theorem

DOI10.1109/18.259637zbMath0798.94011OpenAlexW2171635774MaRDI QIDQ4307364

Oscar Moreno, P. Vijay Kumar

Publication date: 3 October 1994

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.259637

zbMATH Keywords

Deligne's theorembinary cyclic codesbounds for exponential sums in one and several variablesbounds on the minimum distance of cyclic codesgeneralized Reed- Muller codes

Mathematics Subject Classification ID

Bounds on codes (94B65) Cyclic codes (94B15) Exponential sums and character sums (11L99)

Related Items (8)

Index bounds for character sums of polynomials over finite fields ⋮ Affine extractors over large fields with exponential error ⋮ Extractors for varieties ⋮ Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\) ⋮ Some \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\) ⋮ Multidimensional cyclic codes and Artin-Schreier type hypersurfaces over finite fields ⋮ A Class of Nonbinary Codes and Sequence Families ⋮ Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables

This page was built for publication: Minimum distance bounds for cyclic codes and Deligne's theorem