enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. CRC Standard Mathematical Tables - Wikipedia

    en.wikipedia.org/wiki/CRC_Standard_Mathematical...

    The handbook was originally published in 1928 by the Chemical Rubber Company (now CRC Press) as a supplement (Mathematical Tables) to the CRC Handbook of Chemistry and Physics. Beginning with the 10th edition (1956), it was published as CRC Standard Mathematical Tables and kept this title up to the 29th edition (1991).

  3. Category:CRC Press books - Wikipedia

    en.wikipedia.org/wiki/Category:CRC_Press_books

    Download as PDF; Printable version; In other projects ... CRC Concise Encyclopedia of Mathematics; ... CRC Standard Mathematical Tables; Crossing Numbers of Graphs; M.

  4. CRC Handbook of Chemistry and Physics - Wikipedia

    en.wikipedia.org/wiki/CRC_Handbook_of_Chemistry...

    Mathematical Tables from Handbook of Chemistry and Physics was originally published as a supplement to the handbook up to the 9th edition (1952); afterwards, the 10th edition (1956) was published separately as CRC Standard Mathematical Tables. Earlier editions included sections such as "Antidotes of Poisons", "Rules for Naming Organic Compounds ...

  5. Mathematics of cyclic redundancy checks - Wikipedia

    en.wikipedia.org/wiki/Mathematics_of_cyclic...

    A CRC is a checksum in a strict mathematical sense, as it can be expressed as the weighted modulo-2 sum of per-bit syndromes, but that word is generally reserved more specifically for sums computed using larger moduli, such as 10, 256, or 65535.

  6. Computation of cyclic redundancy checks - Wikipedia

    en.wikipedia.org/wiki/Computation_of_cyclic...

    To understand the advantages, start with the slice-by-2 case. We wish to compute a CRC 2 bytes (16 bits) at a time, but the standard table-based approach would require an inconveniently large 65536-entry table. As mentioned in § Generating the tables, CRC tables have the property that table[i xor j] = table[i] xor table[j].

  7. Cyclic redundancy check - Wikipedia

    en.wikipedia.org/wiki/Cyclic_redundancy_check

    The CRC and associated polynomial typically have a name of the form CRC-n-XXX as in the table below. The simplest error-detection system, the parity bit , is in fact a 1-bit CRC: it uses the generator polynomial x + 1 (two terms), [ 5 ] and has the name CRC-1.

  8. Lists of integrals - Wikipedia

    en.wikipedia.org/wiki/Lists_of_integrals

    More compact collections can be found in e.g. Brychkov, Marichev, Prudnikov's Tables of Indefinite Integrals, or as chapters in Zwillinger's CRC Standard Mathematical Tables and Formulae or Bronshtein and Semendyayev's Guide Book to Mathematics, Handbook of Mathematics or Users' Guide to Mathematics, and other mathematical handbooks.

  9. List of hash functions - Wikipedia

    en.wikipedia.org/wiki/List_of_hash_functions

    XOR/table Paul Hsieh's SuperFastHash [1] 32 bits Buzhash: variable XOR/table Fowler–Noll–Vo hash function (FNV Hash) 32, 64, 128, 256, 512, or 1024 bits xor/product or product/XOR Jenkins hash function: 32 or 64 bits XOR/addition Bernstein's hash djb2 [2] 32 or 64 bits shift/add or mult/add or shift/add/xor or mult/xor PJW hash / Elf Hash ...