When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Codes for electromagnetic scattering by cylinders - Wikipedia

    en.wikipedia.org/wiki/Codes_for_electromagnetic...

    Codes for electromagnetic scattering by cylinders – this article list codes for electromagnetic scattering by a cylinder. Majority of existing codes for calculation of electromagnetic scattering by a single cylinder are based on Mie theory , which is an analytical solution of Maxwell's equations in terms of infinite series.

  3. Reed–Muller code - Wikipedia

    en.wikipedia.org/wiki/Reed–Muller_code

    Using low-degree polynomials over a finite field of size , it is possible to extend the definition of Reed–Muller codes to alphabets of size . Let m {\displaystyle m} and d {\displaystyle d} be positive integers, where m {\displaystyle m} should be thought of as larger than d {\displaystyle d} .

  4. Size function - Wikipedia

    en.wikipedia.org/wiki/Size_function

    In size theory, the size function (,): + = {(,): <} associated with the size pair (,:) is defined in the following way. For every (,) +, (,) (,) is equal to the number of connected components of the set {: ()} that contain at least one point at which the measuring function (a continuous function from a topological space to [1] [2]) takes a value smaller than or equal to . [3]

  5. Hadamard code - Wikipedia

    en.wikipedia.org/wiki/Hadamard_code

    Hadamard codes are obtained from an n-by-n Hadamard matrix H. In particular, the 2n codewords of the code are the rows of H and the rows of −H. To obtain a code over the alphabet {0,1}, the mapping −1 ↦ 1, 1 ↦ 0, or, equivalently, x ↦ (1 − x)/2, is applied to the matrix elements.

  6. Test functions for optimization - Wikipedia

    en.wikipedia.org/wiki/Test_functions_for...

    The test functions used to evaluate the algorithms for MOP were taken from Deb, [4] Binh et al. [5] and Binh. [6] The software developed by Deb can be downloaded, [ 7 ] which implements the NSGA-II procedure with GAs, or the program posted on Internet, [ 8 ] which implements the NSGA-II procedure with ES.

  7. Hamming code - Wikipedia

    en.wikipedia.org/wiki/Hamming_code

    A code with this ability to reconstruct the original message in the presence of errors is known as an error-correcting code. This triple repetition code is a Hamming code with m = 2, since there are two parity bits, and 2 2 − 2 − 1 = 1 data bit. Such codes cannot correctly repair all errors, however.

  8. Newton–Cotes formulas - Wikipedia

    en.wikipedia.org/wiki/Newton–Cotes_formulas

    It is assumed that the value of a function f defined on [,] is known at + equally spaced points: < < <.There are two classes of Newton–Cotes quadrature: they are called "closed" when = and =, i.e. they use the function values at the interval endpoints, and "open" when > and <, i.e. they do not use the function values at the endpoints.

  9. Reed–Solomon error correction - Wikipedia

    en.wikipedia.org/wiki/Reed–Solomon_error...

    The Reed–Solomon code is actually a family of codes, where every code is characterised by three parameters: an alphabet size , a block length, and a message length, with <. The set of alphabet symbols is interpreted as the finite field F {\displaystyle F} of order q {\displaystyle q} , and thus, q {\displaystyle q} must be a prime power .