Hamming distance from irreducible polynomials over $\mathbb {F}_2$

Hamming distance from irreducible polynomials over $\mathbb {F}_2$

We study the Hamming distance from polynomials to classes of polynomials that share certain properties of irreducible polynomials. The results give insight into whether or not irreducible polynomials can be effectively modeled by these more general classes of polynomials. For example, we prove that...

Full description

Bibliographic Details
Main Authors: Gilbert Lee, Frank Ruskey, Aaron Williams
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2007-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
irreducible polynomials
random polynomials
hamming distance
finite fields
binary strings
asymptotics
exhaustive enumeration
[info.info-ds] computer science [cs]/data structures and algorithms [cs.ds]
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[math.math-co] mathematics [math]/combinatorics [math.co]
[info.info-cg] computer science [cs]/computational geometry [cs.cg]
Online Access:https://dmtcs.episciences.org/3550/pdf

Internet

https://dmtcs.episciences.org/3550/pdf

Similar Items