fn reed_solomon_multiply(x: u8, y: u8) -> u8 {
        // Russian peasant multiplication
        let mut z: u8 = 0;
        for i in (0..8).rev() {
            z = (z << 1) ^ ((z >> 7) * 0x1D);
            z ^= ((y >> i) & 1) * x;
        }
        z
    }
// Returns the product of the two given field elements modulo GF(2^8/0x11D).
// All inputs are valid. This could be implemented as a 256*256 lookup table.
Returns the product of the two given field elements modulo GF(2^8/0x11D).
All inputs are valid. This could be implemented as a 256*256 lookup table.
Returns the product of the two given field elements modulo GF ( 2^8 / 0x11D ) . All inputs are valid . This could be implemented as a 256 * 256 lookup table .
fn reed_solomon_multiply(x: u8, y: u8) -> u8 {
        // Russian peasant multiplication
        let mut z: u8 = 0;
        for i in (0..8).rev() {
            z = (z << 1) ^ ((z >> 7) * 0x1D);
            z ^= ((y >> i) & 1) * x;
        }
        z
    }
fn reed_solomon_multiply ( x : u8 , y : u8 ) -> u8 { // Russian peasant multiplication let mut z : u8 = 0 ; for i in ( 0 .. 8 ) . rev ( ) { z = ( z << 1 ) ^ ( ( z >> 7 ) * 0x1D ) ; z ^= ( ( y >> i ) & 1 ) * x ; } z }
Returns the product of the two given field elements modulo GF(2^8/0x11D).
Returns the product of the two given field elements modulo GF ( 2^8 / 0x11D ) .
x
u8
y
u8