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...
| Published in: | Discrete Mathematics & Theoretical Computer Science |
|---|---|
| Main Authors: | Gilbert Lee, Frank Ruskey, Aaron Williams |
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2007-01-01
|
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/3550/pdf |
Similar Items
Randomized Optimization: a Probabilistic Analysis
by: Jean Cardinal, et al.
Published: (2007-01-01)
by: Jean Cardinal, et al.
Published: (2007-01-01)
Asymptotics of Riordan arrays
by: Mark C. Wilson
Published: (2005-01-01)
by: Mark C. Wilson
Published: (2005-01-01)
A Note on the Approximation of Perpetuities
by: Margarete Knape, et al.
Published: (2007-01-01)
by: Margarete Knape, et al.
Published: (2007-01-01)
On the Ehrenfeucht-Mycielski Balance Conjecture
by: John C. Kieffer, et al.
Published: (2007-01-01)
by: John C. Kieffer, et al.
Published: (2007-01-01)
Non Uniform Random Walks
by: Nisheeth Vishnoi
Published: (2003-01-01)
by: Nisheeth Vishnoi
Published: (2003-01-01)
Tail Bounds for the Wiener Index of Random Trees
by: Tämur Ali Khan, et al.
Published: (2007-01-01)
by: Tämur Ali Khan, et al.
Published: (2007-01-01)
HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm
by: Philippe Flajolet, et al.
Published: (2007-01-01)
by: Philippe Flajolet, et al.
Published: (2007-01-01)
Stokes polyhedra for $X$-shaped polyminos
by: Yu. Baryshnikov, et al.
Published: (2012-01-01)
by: Yu. Baryshnikov, et al.
Published: (2012-01-01)
On Greedy Trie Execution
by: Zbigniew Gołębiewski, et al.
Published: (2012-01-01)
by: Zbigniew Gołębiewski, et al.
Published: (2012-01-01)
Matching solid shapes in arbitrary dimension via random sampling
by: Daria Schymura
Published: (2012-01-01)
by: Daria Schymura
Published: (2012-01-01)
q-gram analysis and urn models
by: Pierre Nicodème
Published: (2003-01-01)
by: Pierre Nicodème
Published: (2003-01-01)
Distributional analysis of Robin Hood linear probing hashing with buckets
by: Alfredo Viola
Published: (2005-01-01)
by: Alfredo Viola
Published: (2005-01-01)
Simply generated trees, conditioned Galton―Watson trees, random allocations and condensation: Extended abstract
by: Svante Janson
Published: (2012-01-01)
by: Svante Janson
Published: (2012-01-01)
Expected values of statistics on permutation tableaux
by: Sylvie Corteel, et al.
Published: (2007-01-01)
by: Sylvie Corteel, et al.
Published: (2007-01-01)
Combinatorial Dominance Guarantees for Heuristic Algorithms
by: Daniel Berend, et al.
Published: (2007-01-01)
by: Daniel Berend, et al.
Published: (2007-01-01)
Coherent random permutations with record statistics
by: Alexander Gnedin
Published: (2007-01-01)
by: Alexander Gnedin
Published: (2007-01-01)
Counting occurrences for a finite set of words: an inclusion-exclusion approach
by: Frédérique Bassino, et al.
Published: (2007-01-01)
by: Frédérique Bassino, et al.
Published: (2007-01-01)
Domination analysis for scheduling on non preemptive uniformly related machines
by: Idan Eisner, et al.
Published: (2012-01-01)
by: Idan Eisner, et al.
Published: (2012-01-01)
On expected number of maximal points in polytopes
by: Yu. Baryshnikov
Published: (2007-01-01)
by: Yu. Baryshnikov
Published: (2007-01-01)
The volume and time comparison principle and transition probability estimates for random walks
by: András Telcs
Published: (2003-01-01)
by: András Telcs
Published: (2003-01-01)
Osculating Random Walks on Cylinders
by: Saibal Mitra, et al.
Published: (2003-01-01)
by: Saibal Mitra, et al.
Published: (2003-01-01)
Average properties of combinatorial problems and thermodynamics of spin models on graphs
by: Alessandro Vezzani, et al.
Published: (2003-01-01)
by: Alessandro Vezzani, et al.
Published: (2003-01-01)
Rooted trees and moments of large sparse random matrices
by: Oleksiy Khorunzhiy
Published: (2003-01-01)
by: Oleksiy Khorunzhiy
Published: (2003-01-01)
Classification of large Pólya-Eggenberger urns with regard to their asymptotics
by: Nicolas Pouyanne
Published: (2005-01-01)
by: Nicolas Pouyanne
Published: (2005-01-01)
Quantum random walks in one dimension via generating functions
by: Andrew Bressler, et al.
Published: (2007-01-01)
by: Andrew Bressler, et al.
Published: (2007-01-01)
The average position of the first maximum in a sample of geometric random variables
by: Margaret Archibald, et al.
Published: (2007-01-01)
by: Margaret Archibald, et al.
Published: (2007-01-01)
The distribution of ascents of size $d$ or more in samples of geometric random variables
by: Charlotte Brennan, et al.
Published: (2005-01-01)
by: Charlotte Brennan, et al.
Published: (2005-01-01)
A new method for computing asymptotics of diagonal coefficients of multivariate generating functions
by: Alexander Raichev, et al.
Published: (2007-01-01)
by: Alexander Raichev, et al.
Published: (2007-01-01)
Influence of the tie-break rule on the end-vertex problem
by: Pierre Charbit, et al.
Published: (2014-07-01)
by: Pierre Charbit, et al.
Published: (2014-07-01)
Convex hull for intersections of random lines
by: Daniel Berend, et al.
Published: (2005-01-01)
by: Daniel Berend, et al.
Published: (2005-01-01)
And/or tree probabilities of Boolean functions
by: Danièle Gardy, et al.
Published: (2005-01-01)
by: Danièle Gardy, et al.
Published: (2005-01-01)
Constructing a sequence of random walks strongly converging to Brownian motion
by: Philippe Marchal
Published: (2003-01-01)
by: Philippe Marchal
Published: (2003-01-01)
Entropic repulsion on a rarefied wall
by: L. R. G. Fontes, et al.
Published: (2003-01-01)
by: L. R. G. Fontes, et al.
Published: (2003-01-01)
Non-crossing trees revisited: cutting down and spanning subtrees
by: Alois Panholzer
Published: (2003-01-01)
by: Alois Panholzer
Published: (2003-01-01)
Two-anticoloring of planar and related graphs
by: Daniel Berend, et al.
Published: (2005-01-01)
by: Daniel Berend, et al.
Published: (2005-01-01)
The Height of List-tries and TST
by: N. Broutin, et al.
Published: (2007-01-01)
by: N. Broutin, et al.
Published: (2007-01-01)
Analysis of the total costs for variants of the Union-Find algorithm
by: Markus Kuba, et al.
Published: (2007-01-01)
by: Markus Kuba, et al.
Published: (2007-01-01)
Degree distribution of random Apollonian network structures and Boltzmann sampling
by: Alexis Darrasse, et al.
Published: (2007-01-01)
by: Alexis Darrasse, et al.
Published: (2007-01-01)
Exact $L^2$-Distance from the Limit for QuickSort Key Comparisons (Extended Abstract)
by: Patrick Bindjeme, et al.
Published: (2012-01-01)
by: Patrick Bindjeme, et al.
Published: (2012-01-01)
A phase transition in the distribution of the length of integer partitions
by: Dimbinaina Ralaivaosaona
Published: (2012-01-01)
by: Dimbinaina Ralaivaosaona
Published: (2012-01-01)
Similar Items
-
Randomized Optimization: a Probabilistic Analysis
by: Jean Cardinal, et al.
Published: (2007-01-01) -
Asymptotics of Riordan arrays
by: Mark C. Wilson
Published: (2005-01-01) -
A Note on the Approximation of Perpetuities
by: Margarete Knape, et al.
Published: (2007-01-01) -
On the Ehrenfeucht-Mycielski Balance Conjecture
by: John C. Kieffer, et al.
Published: (2007-01-01) -
Non Uniform Random Walks
by: Nisheeth Vishnoi
Published: (2003-01-01)
