Minimum distance bounds for cyclic codes and Deligne's theorem
From MaRDI portal
Publication:4307364
DOI10.1109/18.259637zbMath0798.94011MaRDI QIDQ4307364
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
Deligne's theorem; binary cyclic codes; bounds for exponential sums in one and several variables; bounds on the minimum distance of cyclic codes; generalized Reed- Muller codes
Related Items
Index bounds for character sums of polynomials over finite fields, Affine extractors over large fields with exponential error, Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\), Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables, Extractors for varieties, 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