CoChat
Sign Up
Cited by 4Analytic Number Theory ResearchCoding theory and cryptographyCryptography and Residue Arithmetic

Distribution of Irreducible Polynomials over F 2

Hicks, Kenneth H., Mullen, Gary L., Sato, Ikuro·2002·Finite Fields with Applications to Coding Theory, Cryptography and Related Areas
DOI 10.1007/978-3-642-59435-9_13
Open this paper in CoChat — free account

Integrity signals

Registry

Crossref · 10.1007/978-3-642-59435-9_13

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The summation for the right degree of node C agrees with the number of irreducible polynomials of degree at most n over the Galois field GF(2).

    “Note that this summation agrees with the number of irreducible polynomials of degree at most n over the Galois field GF(2) [20]”

    From From time series to complex networks: the visibility graph (2008) · cites this paper as [20]

Cited by

Sorted by citations

Authors
Hicks, K. H., Mullen, G. L., & Sato, I.
Affiliations
  • Ohio University (US)
  • Pennsylvania State University (US)
Venue
Finite Fields with Applications to Coding Theory, Cryptography and Related Areas
Publisher
Springer Berlin Heidelberg
Published
2002
Pages
177-186
DOI
10.1007/978-3-642-59435-9_13
OpenAlex
W85320263
Cited by
4
References
0
FWCI
2.01
Type
book chapter
Language
en
Open access
closed
Locations
Springer eBooks (publishedVersion)
Topics
  • Physical Sciences › Mathematics › Algebra and Number Theory › Analytic Number Theory Research
  • Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
  • Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
Keywords
irreducible polynomials, binomial distribution, self-reciprocal polynomials, numerical evidence, conjecture

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review