Skip to content

docs: fix typos #228

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Sep 9, 2025
Merged

docs: fix typos #228

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions src/primitives/correction.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -141,7 +141,7 @@ impl<Ck: Checksum> Corrector<Ck> {
/// A bound on the number of errors and erasures (errors with known location)
/// can be corrected by this corrector.
///
/// Returns N such that, given E errors and X erasures, corection is possible
/// Returns N such that, given E errors and X erasures, correction is possible
/// iff 2E + X <= N.
pub fn singleton_bound(&self) -> usize {
// d - 1, where d = [number of consecutive roots] + 2
Expand Down Expand Up @@ -243,7 +243,7 @@ impl<Ck: Checksum> Corrector<Ck> {
/// Out-of-bound error locations will not occur "naturally", in the sense that they
/// will happen with extremely low probability for a string with a valid HRP and a
/// uniform error pattern. (The probability is 32^-n, where n is the size of the
/// range [`Checksum::ROOT_EXPONENTS`], so it is not neglible but is very small for
/// range [`Checksum::ROOT_EXPONENTS`], so it is not negligible but is very small for
/// most checksums.) However, it is easy to construct adversarial inputs that will
/// exhibit this behavior, so you must take it into account.
///
Expand Down