Search results
Jump to navigation
Jump to search
- ...the length of [[Linear code|linear]] [[Binary coding|binary]] [[Block code|code]]s of dimension ''k'' and minimum distance ''d''. For a binary linear code, the Griesmer bound is: ...3 KB (584 words) - 17:46, 4 October 2024
- ...>Bruce Schneier, ''Applied Cryptography: Protocols, Algorithms, and Source Code in C'', pages 463-464, Wiley; 2nd edition (October 18, 1996), {{ISBN|0-471- The following [[Python (programming language)|Python]] source code tests a sequence of numbers to determine if it is superincreasing: ...2 KB (248 words) - 14:44, 10 February 2025
- [[File:1010 0110 Walsh spectrum (fast WHT).svg|thumb|400px|Example for the input vector (1, 0, 1, 0, 0, 1, 1, 0)]] == Python example code == ...3 KB (450 words) - 18:18, 8 December 2024
- The following 4 line MATLAB code segment implements the MPE algorithm: [[Category:Articles with example MATLAB/Octave code]] ...2 KB (274 words) - 10:52, 13 January 2024
- ...ta type <code>A</code> (often written <code>Just A</code> or <code>Some A</code>). ..., while nullable types do not (e.g. <code>String??</code> = <code>String?</code>). ...14 KB (1,979 words) - 02:57, 31 January 2025
- """Lorenz 96 model with constant forcing""" [[Category:Articles with example Python (programming language) code]] ...3 KB (484 words) - 14:57, 11 September 2024
- This can be demonstrated using the following [[MATLAB]] code: And the inverse transform is given by the MATLAB code: ...5 KB (787 words) - 20:01, 17 December 2024
- ...nerators, one of which is the "Hash DRBG", which uses a hash function with a counter to produce a requested sequence of random bits equal in size to t ...mechanism to build a MGF is to iteratively apply a hash function together with an incrementing counter value. The counter may be incremented indefinitely ...7 KB (996 words) - 21:03, 8 April 2024
- ===Example: 2D discrete Laplacian on a regular grid with the homogeneous Dirichlet boundary condition=== Here is a sample [[GNU_Octave|OCTAVE]]/[[MATLAB]] code to compute ''L'' on the regular 10×15 2D grid: ...6 KB (843 words) - 18:50, 27 January 2025
- |image=[[File:Cyclesort.png|none|280px|Example of cycle sort sorting a list of random numbers.]] |caption=Example of cycle sort sorting a list of random numbers. ...8 KB (1,127 words) - 16:58, 25 February 2025
- ...come may reveal a player's true feelings toward the person they are paired with. The game, however, does not accurately predict the true relationship betwe ...| Repeat steps 5 and 6 with the remaining letters of "FLAMES", starting with the next letter, until only one letter remains. ...8 KB (1,193 words) - 04:31, 21 February 2025
- ...h>, i.e. a subset of <math>[q]^n</math>.<ref>Each <math>q</math>-ary block code of length <math>n</math> is a subset of the strings of <math>\mathcal{A}_q^ With large enough <math>n</math>, the ''rate'' <math>R</math> and the ''relative ...5 KB (748 words) - 02:30, 5 December 2023
- ...and in [[quantum communication]]s. The encoding circuit for a large block code typically has a high complexity although those for modern codes do have low ...a much lower complexity than an encoding circuit needed for a large block code. It also has a repetitive pattern so that the same physical devices or the ...13 KB (1,829 words) - 11:21, 2 November 2024
- ...For example, if function ''div''(''x'',''y'') = ''x''/''y'', then ''div'' with the parameter ''x'' fixed at 1 is another function: ''div''<sub>1</sub>(''y ..., for example by creating a function that represents the addition operator with 1 bound as its first argument. ...11 KB (1,589 words) - 15:43, 19 November 2023
- ...f inspiration to [[Graphics|graphic artists]] attempting to imitate nature with mathematical models. The fern code developed by Barnsley is an example of an [[iterated function system]] (IFS) to create a fractal. This follows ...11 KB (1,540 words) - 15:19, 10 November 2024
- ...oints <math>\mathbf{P}_0, \mathbf{P}_1, \mathbf{P}_2, \mathbf{P}_3</math>, with the curve drawn only from <math>\mathbf{P}_1</math> to <math>\mathbf{P}_2</ [[File:Catmull-Rom Spline.png|thumb|Catmull–Rom spline interpolation with four points]] ...14 KB (2,103 words) - 14:01, 31 January 2025
- from [[University of Illinois Urbana-Champaign]] with thesis ''A Generalization of the Shannon-McMillan Theorem and Its Applicati 1. Key works on [[Grammar-based code|grammar-based coding]]: ...10 KB (1,289 words) - 00:41, 2 May 2024
- ...d into codewords of pulses of different weight as they would be in [[pulse-code modulation]] (PCM); rather, the relative [[density]] of the pulses correspo ...of a sine wave. 1s represented by blue, 0s represented by white, overlaid with the sine wave.]] ...10 KB (1,529 words) - 00:22, 15 February 2024
- ...each [[Connected component (graph theory)|connected component]] of a graph with the same running time overall. There is an exception to the expected runnin ...supporting the multiplication, exponentiation, and indexing operators (for example [https://docs.scipy.org/doc/numpy/reference/generated/numpy.matrix.html num ...5 KB (799 words) - 20:57, 12 October 2024
- ...s tested to assess the proper handling of all decision outcomes. As with [[Code coverage|multiple-condition coverage]]<ref>Glenford J. Myers (2004). ''The [[File:ECT Example Inductive Proof Plain.svg|thumb|right|upright=2|Figure 2: ECT Inductive Pro ...12 KB (1,579 words) - 13:56, 14 March 2024