Pages that link to "Item:Q4307364"

The following pages link to Minimum distance bounds for cyclic codes and Deligne's theorem (Q4307364):

Displaying 15 items.

• Index bounds for character sums of polynomials over finite fields (Q329186) (← links)
• Affine extractors over large fields with exponential error (Q347127) (← links)
• Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\) (Q394548) (← links)
• Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables (Q1320443) (← links)
• Extractors for varieties (Q1926108) (← links)
• Some \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\) (Q2190903) (← links)
• Multidimensional cyclic codes and Artin-Schreier type hypersurfaces over finite fields (Q2469468) (← links)
• More on the minimum distance of cyclic codes (Q3197759) (← links)
• (Q3340770) (← links)
• A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set (Q3547985) (← links)
• A Class of Nonbinary Codes and Sequence Families (Q3600428) (← links)
• (Q4709560) (← links)
• A Bound on the Minimum Distance of Quasi-cyclic Codes (Q4915199) (← links)
• On the Minimal Distance of Binary Self-Dual Cyclic Codes (Q4974043) (← links)
• Decoding Cyclic Codes up to a New Bound on the Minimum Distance (Q5271924) (← links)