Hamming distance from irreducible polynomials over F₂

MaRDI QIDQ3576763zbMATH OpenFDO

Authors Gilbert Lee, Frank Ruskey, Aaron Williams

Publication date 2 August 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAH0113/0.html

zbMATH Keywords

asymptoticsHamming distancerandom polynomialsfinite fieldsirreducible polynomialsbinary stringsexhaustive enumeration

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer aspects of numerical algorithms (65Y99)

Recommendations

• Computational experiences on the distances of polynomials to irreducible polynomials
• The distance to an irreducible polynomial. II
• Polynomials generating Hamming codes
• On the number of irreducible polynomials with 0,1 coefficients
• Approximating the number of irreducible polynomials over \(\mathbb F_2\) with several prescribed coefficients

Cited in

(5)

• The distance to an irreducible polynomial. II
• The distance to a squarefree polynomial over $\mathbb F_2[x]$
• The distance to square-free polynomials
• Combinatorial computations on an extension of a problem by Pál Turán
• Hamming polynomials and their partial derivatives

This page was built for publication: Hamming distance from irreducible polynomials over \(\mathbb F_2\)

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