Finite Fields¶
Lidl, R., & Niederreiter, H. (1997). Finite Fields. Cambridge University Press.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Field (Algebraic)
- … and coding theory: AES operates in 𝔽_{2⁸}, elliptic-curve cryptography is defined over 𝔽_p or 𝔽_{2ⁿ}, and Reed–Solomon error-correcting codes are constructed as polynomial evaluation codes over 𝔽_q, with algebraic decoding algorithms that depend on the field structure to factor polynomials and recover erasures
This sourceA treatise devoted entirely to the theory of finite fields and their applications, covering coding theory and the Reed-Solomon codes first studied by Reed and Solomon.
Supported in partVerified against the work's full text
“Chapter 9 - Applications of Finite Fields”
- … and coding theory: AES operates in 𝔽_{2⁸}, elliptic-curve cryptography is defined over 𝔽_p or 𝔽_{2ⁿ}, and Reed–Solomon error-correcting codes are constructed as polynomial evaluation codes over 𝔽_q, with algebraic decoding algorithms that depend on the field structure to factor polynomials and recover erasures
- Irreducible polynomial
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 2 citations: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:50f48e5b4fdd · see in the full table